Problem 186. The Tower of Hanoi

Created by eric landiech

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","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\"?>\n<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>In the</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Tower_of_Hanoi\"><w:r><w:t>Tower of Hanoi problem</w:t></w:r></w:hyperlink><w:r><w:t> with 3 rods (1, 2 &amp; 3), the goal is to move a tower of disks from rod #1 to rod #2. 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: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:pPr><w:r><w:t>Give the number of moves necessary to solve the 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

465 Solutions
280 Solvers

Last Solution submitted on Jul 31, 2022

Last 200 Solutions

Problem Comments

Solution Comments

Solution 6828220

1 Comment

1 Comment

Jan-Andrea Bard on 4 Nov 2021

Ha, ha, so funny, after writing a function with a neat recursive moveNDisks function, realize that the number of moves is 2^n-1.

Problem Recent Solvers280

Problem Tags

Community Treasure Hunt

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

Start Hunting!

Problem 186. The Tower of Hanoi

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers280

Suggested Problems

More from this Author3

Problem Tags

Community Treasure Hunt

Problem 186. The Tower of Hanoi

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers280

Suggested Problems

More from this Author3

Problem Tags

Community Treasure Hunt

Players