Problem 199. hanoi towers II
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
Asif Newaz
on 19 Dec 2019
what do you mean by unused..can u elaborate?
Solution Comments
Show commentsProblem Recent Solvers76
Suggested Problems
-
Determine whether a vector is monotonically increasing
21836 Solvers
-
Calculate the Levenshtein distance between two strings
1472 Solvers
-
897 Solvers
-
580 Solvers
-
1638 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!