Tower of Hanoi problem
1 vue (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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)
Réponses (0)
Voir également
Catégories
En savoir plus sur Dialog Boxes dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!