🗼 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

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

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

All puzzles