Problem 199. hanoi towers II

Created by eric landiech

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>with 3 rods (1,2 &amp; 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.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>At the beginning, all disks are on rod #1, biggest at the bottom, smallest at the top.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Give the smallest sequence of unused rods for a n disks Hanoi tower problem.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

163 Solutions
50 Solvers

Last Solution submitted on Oct 15, 2021

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

Asif Newaz on 19 Dec 2019

what do you mean by unused..can u elaborate?

Solution Comments

Solution 2865971

1 Comment

1 Comment

Lincoln Poon on 25 Dec 2020

Wow! Amazing!!

Solution 556430

1 Comment

1 Comment

Jan Orwat on 12 Jan 2015

simplified classic

Problem Recent Solvers50

Problem Tags

hanoi

Community Treasure Hunt

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

Start Hunting!

Problem 199. hanoi towers II

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers50

Suggested Problems

More from this Author3

Problem Tags

Community Treasure Hunt

Problem 199. hanoi towers II

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers50

Suggested Problems

More from this Author3

Problem Tags

Community Treasure Hunt

Players