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 Solvers361
Suggested Problems
-
17116 Solvers
-
Back to basics 17 - white space
271 Solvers
-
Compute a dot product of two vectors x and y
988 Solvers
-
5185 Solvers
-
Check that number is whole number
4327 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!