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
Solution Comments
Show commentsProblem Recent Solvers83
Suggested Problems
-
Return the largest number that is adjacent to a zero
5549 Solvers
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Project Euler: Problem 16, Sums of Digits of Powers of Two
187 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2150 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
605 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?