What is the Tower of Hanoi?
The Tower of Hanoi is a classic logic puzzle invented by French mathematician Γdouard Lucas in 1883. You're given three pegs and a stack of disks of different sizes, and the goal is to move the whole stack from one peg to another following the rules below.
Rules
- You can only move one disk at a time.
- You can only move the top disk from any peg.
- A larger disk can never be placed on top of a smaller disk.
The minimum-moves formula
With n disks, the minimum number of moves needed is 2βΏ β 1. For example, 4 disks need at least 15 moves, and 6 disks need at least 63. Each extra disk nearly doubles the number of moves required.
Frequently Asked Questions
How do I move a disk?
Click the peg you want to move a disk from, then click the peg you want to move it to. Moves that break the rules are simply ignored.
Are there other logic puzzles like this?
Yes β check out our number merge puzzle, where you combine tiles, or Minesweeper, where you avoid hidden mines.