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 Solvers402
Suggested Problems
-
Find state names that end with the letter A
1198 Solvers
-
Back to basics 13 - Input variables
410 Solvers
-
Back to basics 21 - Matrix replicating
1831 Solvers
-
How long is the longest prime diagonal?
415 Solvers
-
2793 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!