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
-
How to find the position of an element in a vector without using the find function
2822 Solvers
-
Back to basics 17 - white space
280 Solvers
-
Compute a dot product of two vectors x and y
1057 Solvers
-
Find a subset that divides the vector into equal halves
402 Solvers
-
Flip the vector from right to left
11491 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!
