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 comments
Loading...
Problem Recent Solvers398
Suggested Problems
-
Find the "ordinary" or Euclidean distance between A and Z
177 Solvers
-
Back to basics 12 - Input Arguments
626 Solvers
-
Remove the two elements next to NaN value
713 Solvers
-
765 Solvers
-
Convert from Fahrenheit to Celsius
28945 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!
