Tower of Hanoi

Tower of Hanoi — Free Online Classic Logic Puzzle

Play Tower of Hanoi free online! The classic recursive puzzle — move all disks from one rod to another following the rules. 27 levels from 3 to 6 disks, each with a guaranteed optimal solution. No download required.

How to Play

• Move all disks from the left rod to the right rod (or as indicated).
• Move one disk at a time — click a rod to pick up its top disk, click another rod to place it.
• A larger disk can never be placed on top of a smaller disk.
• Only the top disk of each rod can be moved.
• Complete the puzzle in the minimum number of moves: 2^n - 1 (where n = number of disks).
• 27 levels range from 3 disks (7 moves) to 6 disks (63 moves).

Tips & Tricks

• Think recursively: To move n disks, first move n-1 disks to the spare rod, move the largest disk to the target, then move n-1 disks on top.
• Odd vs even parity: For an odd number of disks, the first move goes to the target rod. For an even number, it goes to the spare rod.
• Memorize the minimum: The optimal solution is always 2^n - 1 moves. Knowing this helps you track efficiency.
• Don't backtrack: Undoing moves wastes your move count. Plan each move before committing.
• Practice with 3 disks first: Master the 7-move solution before tackling larger towers.

Frequently Asked Questions