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 Solvers73
Suggested Problems
-
340 Solvers
-
Least common multiple of many numbers
226 Solvers
-
Find out missing number from a vector of 9 elements
290 Solvers
-
Make a vector of prime numbers
630 Solvers
-
Check that number is whole number
3919 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!