🗼
Tower of Hanoi
Move the stack of disks between pegs — a classic mathematical puzzle.
Puzzle
v1.0.0
22 uses
🗼
Tower of Hanoi
Esc
or
Ctrl+Shift+F
to exit
Moves
0
Minimum
7
Timer
0:00
Best
-
A
B
C
Congratulations!
About This Game
The Tower of Hanoi is a classic mathematical puzzle. Move all disks from the first peg to the last peg, one at a time. You can never place a larger disk on top of a smaller one. The minimum number of moves is 2^n - 1.
How to Play
- 1 Select the number of disks (3-8)
- 2 Click a peg to pick up the top disk
- 3 Click another peg to place it
- 4 You cannot place a larger disk on a smaller one
- 5 Move all disks from the first peg to the last
- 6 Try to solve it in the minimum number of moves