Rebuilding a tower of ten rings
Ten rings labeled (smallest, on top) to (largest, on bottom) are stacked on one of three poles. Move the whole stack to another pole, moving one ring at a time and never placing a larger ring on a smaller one. What is the minimum number of moves?
Show hints (2)+
- Tower of Hanoi: moving disks costs .
- .
Answer
Reveal answer →Final answer
1023
Create a free account to see the full worked solution and track your progress.
Interview format: Market Maker, Systematic & Data-Driven Trading