How do you play Tower of Hanoi?

Click a tower to select it (it will highlight), then click another tower to move the top disk there. You can only place a smaller disk on top of a larger one. Move all disks to tower C to win!

What is the minimum number of moves for Tower of Hanoi?

The minimum moves required is 2^n - 1, where n is the number of disks. For 3 disks: 7 moves; 4 disks: 15 moves; 5 disks: 31 moves; 6 disks: 63 moves.

Is Tower of Hanoi free to play?

Yes! Tower of Hanoi on Knexio is completely free, works in any browser, and requires no download or registration.

← Back to Games

🗼 Tower of Hanoi

Classic mathematical puzzle — move all disks to tower C!

Moves

Minimum

Time

00:00

🎉 Congratulations!

You solved it in 0 moves in 00:00!

📜 Rules

Move only one disk at a time
Only the top disk of a tower can be moved
Never place a larger disk on top of a smaller disk
Goal: move all disks from tower A to tower C

About Tower of Hanoi

The Tower of Hanoi is a classic mathematical puzzle invented by French mathematician Édouard Lucas in 1883. It consists of three rods and a number of disks of different sizes which can slide onto any rod.

Mathematical Facts

Minimum moves required: 2ⁿ − 1 (where n = number of disks)
3 disks → 7 moves | 4 disks → 15 moves | 5 disks → 31 moves | 6 disks → 63 moves
If you moved one disk per second, 64 disks would take ~585 billion years!
The puzzle is used to teach recursion in computer science courses worldwide.

Strategy Tips

Think several moves ahead before acting
Use tower B as temporary storage strategically
The largest disk should move only once — directly to tower C
Smaller disks move far more frequently than larger ones

Frequently Asked Questions

How do I move a disk?

Click a tower to select it (it highlights in blue). Then click the destination tower to move the top disk there. Click the same tower again to deselect.

What does the Auto Solve button do?

It resets the puzzle and demonstrates the optimal recursive solution step by step, so you can watch and learn the algorithm.

How is the minimum number of moves calculated?

The formula is 2ⁿ − 1. For 4 disks that's 2⁴ − 1 = 15 moves. Achieving the minimum earns a perfect-solution badge!

Is this game free to play?

Yes — completely free, no download or login required. It runs entirely in your browser on any device.

More Puzzle Games

About This Game

This is a fun browser game that you can play for free. Enjoy this entertaining game with simple controls and engaging gameplay.

Our version is built from scratch in vanilla JavaScript, optimized for performance across all devices. The game runs entirely in your browser, with no downloads or installations required. All progress is saved locally in your browser's storage.

Like all games on Knexio, This Game is completely free to play. We support our games through non-intrusive advertisements that never interfere with the gameplay experience.