Tower of Hanoi problem
1 Ansicht (letzte 30 Tage)
Ältere Kommentare anzeigen
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.
![](https://www.mathworks.com/matlabcentral/answers/uploaded_files/940859/image.png)
1 Kommentar
Antworten (0)
Siehe auch
Kategorien
Mehr zu Dialog Boxes finden Sie in Help Center und File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!