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
Want the full step-by-step worked solution? It's part of Premium - along with a worked solution for every question in the bank.
Asked at: Jane Street, Two Sigma