China’s Nine Linked Rings: Why a Simple-Looking Puzzle Takes 341 Moves

Nine rings. One metal handle. Surely the aim is to slide the handle free nine times? China’s nine linked rings puzzle has a surprise: from its standard starting position, removing the handle takes at least 341 individual ring moves. The difficulty is not finding a hidden catch. It is learning why a ring you just freed may need to go back on before the next one can come off.

Meet the Puzzle

Known in Chinese as jiǔ lián huán (九连环), the nine linked rings puzzle has nine rings attached in a row to a connected structure. A long, looped handle passes through them. Your goal is to work that handle free of every ring without bending, opening, or detaching any part.

Each ring has two useful states: on the handle or off it. For the 341-move count, a move means changing the state of one ring. That sounds manageable until you discover that most rings cannot move whenever you please. Their positions determine which other rings are available.

This is what makes the puzzle so inviting. You can understand the goal at a glance, yet removing a ring changes the possibilities for every ring beyond it. It is less like undoing nine separate fasteners and more like following a carefully arranged sequence.

Two Rules Control Every Move

The mechanism may look complicated, but its legal moves can be described with two rules. Number the rings from 1 to 9, starting at the looped end of the handle:

1. Ring 1 can always move on or off the handle.
2. One other ring may move: the ring immediately after the first ring that is currently on the handle. If no ring is on, there is no second choice.

Suppose rings 1 and 2 are off, but ring 3 is on. Ring 3 is now the first ring on the handle, so ring 4 is the other ring you can move. Ring 7 might be the one you most want to free, but you cannot jump straight to it. You must arrange the earlier rings until they give you access.

The rules also explain an initially puzzling sight: rings going back on the handle during a successful solution. Putting a ring back is not necessarily a mistake. It can be the move that lets you reach a different ring later.

A Five-Move Version You Can Follow

Before tackling nine rings, imagine a version with just three. Begin with all three on the handle. The shortest solution is:

1. Take ring 1 off.
2. Take ring 3 off. Ring 2 is now the first ring on, making ring 3 movable.
3. Put ring 1 back on.
4. Take ring 2 off. Ring 1 is now the first ring on.
5. Take ring 1 off again.

All three are off after five moves. Notice that ring 1 had to move three times and, halfway through, moved in the direction that seemed to undo your progress. That small detour is the heart of the nine-ring puzzle.

Why the Count Reaches 341

The shortest move counts grow quickly as rings are added:

| Number of rings | Minimum moves | |---:|---:| | 1 | 1 | | 2 | 2 | | 3 | 5 | | 4 | 10 | | 5 | 21 | | 6 | 42 | | 7 | 85 | | 8 | 170 | | 9 | 341 |

Why such a leap? To remove a high-numbered ring, you must first arrange the lower-numbered rings into a particular pattern. Then, after moving that high-numbered ring, you must rearrange the lower rings to continue. Parts of the puzzle have to be solved, undone, and solved again.

Mathematicians can express that repeated work with a recurrence: a rule that uses earlier answers to find the next one. If M(n) is the minimum number of moves for n rings, then:

M(n) = M(n − 1) + 2M(n − 2) + 1

Start with M(1) = 1 and M(2) = 2, and the rule produces the table above. For nine rings, the same count can be written as (2¹⁰ − 1) ÷ 3 = 341. The mathematics of the baguenaudier at Wolfram MathWorld gives both the recurrence and the sequence.

Why can’t a clever solver skip ahead? Because a later ring becomes movable only after the earlier rings reach the required arrangement. You can move faster with practice, but under the one-ring-per-move convention you cannot shorten the required sequence from the standard all-on starting position. Some sources give different totals because they count a simultaneous movement of two end rings as one move; that is a different counting convention.

The Pattern Behind the Metal

There is another way to picture the puzzle. Write 1 when a ring is on the handle and 0 when it is off. Nine rings then form a nine-digit string, such as 111111111 for the starting position and 000000000 for the goal.

Every individual move changes one digit. The solution is related to a Gray code: an ordering of binary strings in which neighboring strings differ in just one digit. That connection lets a physical object you can hold in your hands be studied as a pattern of changing states. A Brandeis University guide to Chinese rings walks through the connection and the move count.

You do not need to know binary notation to solve the puzzle. The connection simply reveals why its movements feel so rhythmic: change one ring, change another, return to the first, and keep working through the pattern. For a different Chinese puzzle that turns a few simple pieces into many possibilities, explore the global journey of tangrams.

A Long History—with One Important Mystery

Linked-ring challenges appear in old Chinese accounts, but those references do not prove that people were using this exact nine-ring mechanism at the time. The earliest known Chinese mention specifically identifying a metal nine linked rings toy comes from the sixteenth-century writer Yang Shen. Around 1510, the Italian mathematician Luca Pacioli also described a linked-rings puzzle and gave a solution for seven rings. Since the surviving descriptions appear so close together, the puzzle’s precise place of invention remains uncertain.

What is clear is that nine linked rings became part of Chinese cultural life. They appear in literature, art, and records of finely made objects. An 1892 print by Wu Youru, for example, shows people playing with the puzzle—not studying an abstract formula, but enjoying a challenge together. The illustrated history and solving guide at ChinesePuzzles.org offers a closer look at that story.

That mix of play and mathematics is part of the puzzle’s appeal. Much like the number patterns explored in magic squares around the world, a simple-looking arrangement can hold far more structure than it first reveals.

How to Start Solving Without Memorizing 341 Steps

You do not need a list of 341 instructions. Start with all nine rings on and use the two rules. Because nine is odd, the shortest solution begins by taking ring 1 off. After that, alternate between moving ring 1 and moving the ring immediately after the first ring that is on the handle. Watch the ring states closely so you do not accidentally reverse a move you have just made.

If nine rings feel overwhelming, begin by tracing the three-ring example, then look at the five-ring count: 21 moves. You will meet the same kind of temporary setback again and again. Once you recognize it, the long solution stops looking like 341 unrelated decisions and starts looking like one idea repeated at larger scales.

That is the nine linked rings puzzle’s best surprise. The metal never hides the answer from you. It asks you to accept that the route forward sometimes passes through a step that looks backward—and to keep following the pattern until the handle is free.