FREE PUZZLE
Tower of Hanoi
Move the whole stack of disks to the last peg in the fewest moves possible.
Moves
0
Minimum Possible
15
Your Best
-
Why Use Our Tower of Hanoi?
Classic Disk-Moving Puzzle
Move the entire stack from the first peg to the last, never placing a larger disk on a smaller one.
Simple Click-to-Move Controls
Click a peg to pick up its top disk, then click another peg to drop it - no dragging needed.
Compare Against the Minimum
See the mathematical minimum number of moves (2^n - 1) next to your actual move count.
3 to 7 Disks
Choose your difficulty by disk count, from a quick 3-disk round to a real 7-disk challenge.
Best Score Saved
Your fewest moves to solve each disk count is saved on this device.
100% Private
Everything runs in your browser. Nothing is ever sent to a server.
Frequently Asked Questions
How do I play Tower of Hanoi?
Click a peg to pick up its top disk, then click another peg to drop it there. You can only place a disk on an empty peg or on top of a larger disk.
What's the goal?
Move the entire stack of disks from the first peg to the last peg, using the middle peg as needed.
What is the minimum possible moves number?
It's 2^n - 1, where n is the number of disks. For example, 4 disks can be solved in as few as 15 moves.
Is my best score saved?
Yes. Your fewest moves to solve each disk count is saved in your browser's local storage.
Is this game free?
Yes. It's free to play with no sign-up.
More Tools