➤Click a peg to pick up its top disk, then click another peg to place it
➤Rule: You cannot place a larger disk on top of a smaller one
➤Trains recursive thinking, planning ahead, and problem decomposition
Moves: 0Time: 0:00Minimum: 15
🎯 Move all disks to Peg C
A
B
C ★
🎉 Puzzle Solved!
See the results below
0/15
Optimal Solution
A
B
C ★
Puzzle Summary
Recent Results
📘 Detailed Instructions
Tower of Hanoi is a classic mathematical puzzle invented in 1883. The objective is to move an entire stack of disks from one peg to another, following specific rules.
Rules:
Only one disk can be moved at a time
Each move consists of taking the top disk from one peg and placing it on top of another peg
No disk may be placed on top of a smaller disk
Optimal Solution (Classic Mode):
The minimum number of moves required is 2ⁿ - 1, where n is the number of disks
3 disks: 7 moves minimum
4 disks: 15 moves minimum
5 disks: 31 moves minimum
6 disks: 63 moves minimum
7 disks: 127 moves minimum
Strategy Tip: Think recursively! To move n disks from A to C: first move n-1 disks from A to B, then move the largest disk from A to C, then move n-1 disks from B to C.