Cody

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.

Solve

Solution Stats

39.11% Correct | 60.89% Incorrect
Last Solution submitted on Dec 03, 2023

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers73

Suggested Problems

More from this Author3

Problem Tags

hanoi

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!