🗼 Tower of Hanoi

Move the disk stack to another peg. Larger disks can't go on smaller ones!

A.K.A.

Also known as: Tower of Brahma, Lucas Tower

Category

Tile & Spatial

How to Play

1. Move all disks from the starting peg to another peg
2. Move only one disk at a time
3. A larger disk cannot be placed on a smaller disk
4. Use the spare peg as intermediate storage
5. Minimum moves = 2^n - 1 (n = number of disks)

Puzzle Source

➖ N/A

This is a sandbox/classic puzzle without generated content.

Source: Classic Tower of Hanoi - configurable disk count

Tips & Strategy

• Move the smallest disk first, then alternate
• The recursive pattern: move n-1 disks, move largest, move n-1 back
• For 3 disks: move smallest every other turn, alternating direction

Issues & Bugs

🔍 Search existing issues for "TowerOfHanoi"

📝 Report a new bug

---

Part of the Enigma puzzle collection