hanoi towers II - MATLAB Cody - MATLAB Central

Problem 199. hanoi towers II

Difficulty:
(153)
Rate

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.13% Correct | 60.87% Incorrect
Last Solution submitted on May 13, 2025

Problem Comments

Solution Comments

Show comments
PIVlab surpasses 100K all-time File Exchange downloads
During the past twelve months, PIVlab, a MATLAB Community Toolbox for particle...
Mike Croucher in General
4
8
View Post
LLMs with MATLAB updated to support the latest OpenAI Models
Large Languge model with MATLAB, a free add-on that lets you access...
Toshiaki Takeuchi in Generative AI
2
4
View Post

Problem Recent Solvers75

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!