What is the minimum number of moves?
For N disks, the minimum is 2^N − 1.
Can I move more than one disk at a time?
No, only one disk per move.
Why is it called Tower of Hanoi?
The puzzle was popularized with a legend about monks moving disks in a temple in Hanoi.
Is there a pattern?
Yes, the recursive solution repeats the same sequence at different scales.
What is the hardest part?
Keeping track of where the smaller disks need to be staged.
