Move a stack of graduated disks from the first peg to the last, one disk at a time, never placing a larger disk on a smaller one. The challenge is sequencing your moves so the whole tower migrates intact. Fewer disks solve quickly while extra disks grow the move count steeply.
How to play Tower of Hanoi
- Take the top disk from any peg and move it to another peg
- Never set a larger disk on top of a smaller one
- Shuttle disks between the three pegs to rebuild the stack
- Reassemble the full tower on the target peg in size order
- Aim to finish in as few moves as possible
Tips & strategy
- The smallest disk should move every other turn in a steady cycle
- For an odd disk count, first move the small disk toward the goal peg
- Think recursively: move the top stack aside, shift the base, then rebuild
Controls: Click or drag a disk to a peg
Tower of Hanoi — FAQ
What is the minimum number of moves?
For n disks the optimal solution takes 2 to the power of n, minus one moves.
Can I move more than one disk at once?
No, only the single top disk of a peg may move on each turn.
How do you solve the Tower of Hanoi?
Move the entire stack of disks from the first peg to the last, one disk at a time, never placing a larger disk on top of a smaller one. The trick is to move the smaller stack out of the way, shift the biggest disk, then rebuild the stack on top of it.
What is the minimum number of moves in Tower of Hanoi?
The fewest moves needed is 2 to the power of the number of disks, minus one, so three disks take seven moves and four disks take fifteen. Trying to match that minimum is the real challenge of the puzzle.
Is Tower of Hanoi free to play with no download?
Yes, Tower of Hanoi is free and plays instantly in your browser with no download or sign-up. It also works fully offline in the free Offline Games Arcade app for iOS and Android.
Is the Tower of Hanoi hard?
With three disks it is easy and a great warm-up, but each disk you add roughly doubles the moves and the difficulty. It is a classic logic puzzle that rewards planning ahead.
