Tower of Hanoi — Free Disk Puzzle
Move one disk at a time in a classic three-tower puzzle
Runs in your browser · nothing is uploaded
One thoughtful move.
Move every disk to the right-hand tower C.
Choose a source tower.
How to play
Select a source tower, then a destination. Only the top disk can move, and larger disks cannot sit on smaller ones. Focus the board and use 1, 2 and 3 to select towers with a keyboard.
Choose 3–7 disks. Refreshing the page resets your progress.A quiet challenge in three towers
Move all disks from tower A on the left to tower C on the right. Tower B gives you temporary space. Choose between 3 and 7 disks. Game inputs are processed in your browser without being sent to a server.
How to play
- Select the source tower, then the destination.
- Only the top disk moves. Select the same tower again to cancel your selection.
- Undo a move to explore a different route.
- Focus the board and use keys 1, 2 and 3 to select towers A, B and C.
Rules and example
You cannot place a larger disk on a smaller disk. For three disks, the optimal route is A→C, A→B, C→B, A→C, B→A, B→C, A→C. Each extra disk doubles the minimum move count and adds one more move.
FAQ
What is the minimum move count?
For n disks, the minimum is 2ⁿ−1 moves. Three disks need 7 moves, four need 15, and seven need 127.
Can a larger disk go on a smaller one?
No. Move only the top disk, placing it on an empty tower or on a larger disk.
Is my progress saved?
The game and undo history stay in page memory. Refreshing or closing the page clears them.
