Interactive Mathematics
Subscribe
About
Türkçe
Towers of Hanoi
Move all disks in the minimum number of moves!
How to Play
1.
On each move you may pick up only the topmost disk and place it on another tower.
2.
A larger disk can never sit on top of a smaller one.
3.
You win once every disk is stacked on the rightmost tower!
3
disks
3
4
5
6
7
Not played yet
Moves:
0
Optimal:
7
Undo
Restart
Other Content
Birthday Paradox
What's the probability of a shared birthday in a group of 23 people?
Caesar Cipher
Encode and decode messages using a Caesar cipher.
Collatz Conjecture
Unsolved since 1937: does every number eventually reach 1?
Königsberg Bridges
Can you cross all seven bridges exactly once?
Map Coloring
Can every map be colored with just 4 colors? Explore the Four Color Theorem.
Pappus's Hexagon Theorem
Two lines, six points, six segments. Why do the intersection points always line up?
Galton Board
How do balls falling through a lattice of pegs always end up forming the same shape?
