🗼 Tower of Hanoi
Move the whole stack to the far peg — never a bigger disk on a smaller.
DISKS
MOVES 0OPTIMAL 15BEST —
Move the whole stack to the far peg — never a bigger disk on a smaller.
| Input | Action |
|---|---|
| Tap a peg | Lift its top disk, or drop the held disk |
| Ctrl+F | Enter or leave full screen |
| Ctrl+P / Ctrl+Space | Pause and resume |
For n disks the optimal solution takes 2ⁿ−1 moves: 7 for three disks, 15 for four, 31 for five, and so on.
Yes — Tower of Hanoi always has a solution, and the game shows the optimal count to aim for.
Your record is the fewest moves you have used to solve each disk count.