Sequence-system sample / Nine Linked Rings

A hand puzzle that turns order into mathematics.

Nine Linked Rings is the sequence-system sample in this maker-run resource. It sits between Tangram and Huarong Dao because the first shelf is about shape, sequence, and search: three ways old puzzle objects become readable systems for people, mathematics, and AI.

Mechanical ringsRecursive sequenceSource pages 162-193

Read the system

The mechanism makes recursion tangible.

The object is simple to recognize and surprisingly strict to operate. Once the legal dependencies are visible, Nine Linked Rings becomes a compact way to feel recursion, binary-like notation, and move sequences through your hands.

01

How the mechanism works

Each ring can be on or off the handle, but the player does not get to flip any ring freely. A legal move depends on the nearby support pattern, so the physical object behaves like an ordered state sequence.

02

What the sources can support

The source material supports Nine Linked Rings as a traditional mechanical puzzle explained through binary-like state strings and move-count conventions. Gray-code language is a modern explanatory tool, not a historical label to project back onto the older object.

03

What AI and sequence models can study

Every visible ring pattern can be treated as a state. A model can compare legal transitions, predict the next move, count paths, and explain why a move that looks backward may be necessary for later progress.

Try the sequence

Step through the code behind the mechanism.

The stepper does not pretend to replace the feel of metal rings in the hand. It gives one readable slice of the dependency chain, so you can see why the next legal move is often not the move your intuition wants first.

Move 1 of 7

Begin with all nine rings on the handle.

111111111

This full state gives the reader a stable starting point before any recursive preparation begins.

Prediction mode

Predict the next legal ring

Choose the ring that can legally move next before revealing the answer.

Status
Predicting
Correct predictions
0
Choose the ring that changes next

Look for the support pattern that makes one ring movable.

Hidden mathematics

Rules create recursion.

The puzzle is not solved by moving any ring at will. A larger change usually requires preparing a smaller configuration first, then restoring part of the pattern so another ring becomes legal.

01

State code

Treat each on/off ring pattern as one readable state in a sequence.

02

Recursion

Prepare a smaller ring pattern before a larger ring can legally change.

03

Move count

Compare fast and slow conventions only after naming the rule behind the count.

Nine Linked Rings library

Read the sequence guide before stepping deeper.

Nine Linked Rings

Nine Linked Rings as a Sequence System

A bridge from a traditional mechanical puzzle to binary-like state notation and recursive solving.

Source pages 162-193Read the sequence guide

Next learning mode

Predict the next legal ring.

The next interaction layer should ask visitors to predict the next legal ring before revealing the move. That keeps the task small: learn the rule, test a guess, and then connect the answer back to the binary-like state string.