Interactive Towers of Hanoi
Choose n from 1 to 5 and explore the minimum solution step by step.
Number of disks:
1
2
3
4
5
Set n
▶ Play
|< First
< Previous
Next >
Last >|
Reset
Recurrence Relation
Tₙ = 2Tₙ₋₁ + 1
T₁ = 1
Move Sequence