with 3 rods (1,2 & 3), the goal is to move a tower of n disks from rod #1 to rod #3. 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 smallest sequence of unused rods for a n disks Hanoi tower problem.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers85
Suggested Problems
-
Getting the indices from a vector
12595 Solvers
-
135 Solvers
-
727 Solvers
-
Natural numbers in string form
1976 Solvers
-
1057 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!
what do you mean by unused..can u elaborate?