How many moves does Tower of Hanoi take?

The minimum number of moves to solve Tower of Hanoi with N disks is 2ⁿ − 1. For 3 disks that's 7 moves, 4 disks = 15, 5 disks = 31, 6 disks = 63, and 7 disks = 127 minimum moves.

Is this Tower of Hanoi game free?

Yes — 100% free, no ads, no account, no download required. Play instantly in any browser on mobile or desktop.

What is auto-solve mode?

Auto-solve uses the optimal recursive algorithm to demonstrate the solution step by step. It's great for learning the strategy. You can watch it solve 3–7 disks at adjustable speed.

Does Tower of Hanoi save my scores?

Yes. Your leaderboard, best score, perfect solves and games played are saved locally in your browser. No account needed — return any time to pick up your records.

What is a Perfect Solve?

A Perfect Solve is when you complete the puzzle in exactly 2ⁿ − 1 moves — the mathematical minimum. Perfect solves are tracked separately in your stats and marked with a ⭐ in the leaderboard.

🧩 Classic Logic Puzzle · Free · No Login

TOWER OF HANOI

Q: What is Tower of Hanoi?

Tower of Hanoi is a classic mathematical puzzle. You have 3 pegs and a stack of disks. Move all disks from the left peg to the right peg, one at a time, never placing a larger disk on a smaller one.

Move all disks from the source peg to the target peg — one disk at a time, never placing a larger disk on a smaller one. Achieve the minimum possible moves to earn a perfect score. Free brain training, no download needed.

0Games Played

—Best Moves

0Perfect Solves

3–7Disk Levels

🆓 Free to Play Mobile Friendly 🧠 Brain Training Leaderboard Auto-Solve Mode ↩️ Undo Moves No Download 🚫 No Ads

Initiate sequence to begin.

PRIMARY

TRANSIT

TARGET

Moves

Best Possible

Overhead

0:00

Elapsed

SYSTEM ARCHIVE

Awaiting new records...

// HOW TO PLAY

👆

Select a Disk

Click or tap any disk on top of a peg to lift it. Only the top disk on each peg can be selected.

Place It

Click the destination peg to place the disk. You can never place a larger disk on top of a smaller one.

Win Condition

Move all disks to the TARGET peg (rightmost). For N disks, the minimum moves needed is 2ⁿ − 1.

↩️

Undo Moves

Made a mistake? Use the UNDO button to step back one move. Unlimited undos — but they count toward your total.

Auto-Solve

Watch the AI solve the puzzle using the optimal recursive algorithm. Great for learning the strategy.

Perfect Score

Solve in exactly 2ⁿ − 1 moves to earn a Perfect Solve badge. These are counted separately in your stats.

DIFFICULTY REFERENCE

Disks	Min Moves	Label	Formula
3	7	Quick	2³ − 1
4	15	Normal	2⁴ − 1
5	31	Tough	2⁵ − 1
6	63	Expert	2⁶ − 1
7	127	Genius	2⁷ − 1

FREQUENTLY ASKED

What is Tower of Hanoi? ▾

Tower of Hanoi is a classic math puzzle invented in 1883. Move all disks from peg 1 to peg 3, one at a time, never placing a larger disk on a smaller one. The minimum solution takes 2ⁿ − 1 moves for n disks.

How many moves does it take? ▾

Minimum moves = 2ⁿ − 1. For 3 disks: 7 moves. 4 disks: 15. 5 disks: 31. 6 disks: 63. 7 disks: 127. The game shows your overhead vs the optimal in real time.

How does auto-solve work? ▾

Auto-solve uses the classic recursive algorithm to solve the puzzle optimally. Watch it animate step by step — great for learning the strategy. Speed adjusts based on disk count.

Is this game free? Does it save scores? ▾

100% free, no ads, no account needed. Your leaderboard, best score, perfect solves and games played are all saved in your browser's localStorage. Return any time and your records will be there.