Tower of Hanoi
Move all discs from the left peg to the right peg. You can only place a smaller disc on a larger one.
0
Moves
7
Min Moves
—
Best Moves
Click a peg to select it, then click destination
About Tower of Hanoi
A classic mathematical puzzle. You have three pegs and a number of discs of different sizes. The goal is to move all discs from the leftmost peg to the rightmost peg, following two rules:
Rules
- Only one disc can be moved at a time.
- A larger disc may never be placed on top of a smaller disc.
- The minimum number of moves required is 2ⁿ − 1 (where n = number of discs).