Tower of Hanoi
Move the stack to the last peg — one disk at a time, never a larger disk on a smaller one.
Moves: 0 · Best possible: 31 · Your best: —
Tap a peg to pick up its top disk, then tap another peg to drop it
About this game
A classic 1883 puzzle: move the stack obeying two rules. The shortest solution always takes exactly 2ⁿ − 1 moves.
Tips & auto-solve
Solve it recursively; match the best-possible count, or watch Auto-solve play the perfect solution. Best saved per size.