🗼 Tower of Hanoi
Move all disks to the last tower!
Disks
3
Moves
0
Optimal
7
🗼
Tower of Hanoi
Move all disks to the last tower!
Select number of disks
How to Play
1. Move all disks from tower A to tower C
2. Only one disk can move at a time
3. Larger disk cannot be on smaller disk
4. Try to complete in minimum moves
💡 Tip: Optimal solution is 2ⁿ-1 moves. Practice recursive thinking!
About This Game
Tower of Hanoi is a classic puzzle invented by a French mathematician in 1883. Often used to explain recursion in programming, it is great for logical thinking.