🗼 Tower of Hanoi

Tower of Hanoi is the classic recursive puzzle. Move the stack of disks to the far peg, one disk at a time, never placing a larger disk on a smaller one.

How to play

Tap a peg to pick up its top disk, then tap the destination peg.
The minimum number of moves is 2ⁿ−1 — shown as the par.
Finish the stack on the last peg; moves and time both count.

Strategy tips

Think recursively: to free the bottom disk, first park the n−1 stack on the spare peg.
The 3-disk pattern (7 moves) is the core of every bigger solve — drill it until automatic.
Alternate the smallest disk with "real" moves — it should move every other turn.

FAQ

Can I put a big disk on a small one?

Never — that is the one rule of the game.

What does par mean?

The fewest possible moves: 2ⁿ−1 for n disks. Beating par is impossible; matching it is the goal.

Does the stack size change?

Yes — difficulty sets how many disks you start with.

Difficulty affects grid size and time is your score — finish fast, post to the daily leaderboard, or race a friend.