Problem 186. The Tower of Hanoi
In the Tower of Hanoi problem with 3 rods (1, 2 & 3), the goal is to move a tower of disks from rod #1 to rod #2. You can move disks only one by one, on the rods. You can't put a disk on a smaller one.
At the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.
Give the number of moves necessary to solve the problem.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers360
Suggested Problems
-
Get the area codes from a list of phone numbers
1052 Solvers
-
454 Solvers
-
8875 Solvers
-
Vectorize the digits of an Integer
317 Solvers
-
587 Solvers
More from this Author3
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!