Tower of Hanoi — Visual Demo
Solve automatically or step through moves. A clean recursive example.
Min moves: —
Disks:
3
Reset
Step
Solve
Pause
A
B
C
Move:
0
/
0
Last move:
—