Tower of Hanoi
What is the minimum number of moves to solve the Tower of Hanoi with 3 disks?
Show hints (2)+
- The count doubles (plus one) per disk.
- $2^n-1$.
Answer
Reveal answer →Final answer
7
Want the full step-by-step worked solution? It's part of Premium — along with a worked solution for every question in the bank.