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 Solvers328
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
5937 Solvers
-
472 Solvers
-
Increment a number, given its digits
637 Solvers
-
Vectorize the digits of an Integer
312 Solvers
-
Magic is simple (for beginners)
8393 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!