Tower of Hanoi problem
1 view (last 30 days)
Show older comments
There are three bars and n disks with holes in the center are stacked like towers on A bars. I'm going to move this tower to the C-bar. Enter N and create a program that shows the process of moving this tower. However, the disk grows as the number goes up, and the large disk cannot go up on the small disk. Tip: Use a recursive function.
Answers (0)
See Also
Categories
Find more on Dialog Boxes in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!