🗼 Tower of Hanoi
A recursive algorithm demo — minimum moves for
n
disks:
2ⁿ − 1
Number of disks:
Show Solution
▶ Animate
↺ Reset
Speed:
Total moves required:
—
Moves made:
0
Solution steps
Press “Show Solution” to generate the steps.