Tower of Hanoi — Visual Recursive Demo
Pegs:
Disks:
Reset
Solve (Animate)
Step
Speed:
500 ms
1
2
3
4
Rod 1
Rod 2
Rod 3
Python Recursion Call Stack Visualization
Click "Solve (Animate)" or "Step" to see recursion in action
Move 0 of 0
Your moves: 0
Optimal: 15