Tower of Hanoi
The legendary algorithmic puzzle. Can you move all the disks to the last peg without breaking the rules?
Tower of Hanoi
Move all disks to the rightmost peg. Larger disks cannot be placed on smaller ones.
Moves: 0
Click a peg to select its top disk, then click another peg to drop it. Minimum possible moves: 31.
About Tower of Hanoi
The Tower of Hanoi is a mathematical game or puzzle invented by the French mathematician Édouard Lucas in 1883. It is widely used in computer science to teach recursive algorithms, and in cognitive psychology to assess problem-solving skills and executive function.
Rules
- Only one disk may be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack.
- No larger disk may be placed on top of a smaller disk.