Towers of Hanoi
The objective of Towers of Hanoi is to move all blocks from the left-most peg to the right-most peg. In doing so, however, the player can only access/move the top block from each peg and cannot place a larger block on top of a smaller block.
This application provides a GUI for the user to manually solve the puzzle or request that the computer graphically solve the puzzle for them (auto-solution can be stopped at any time to allow the player to finish the solution).
The imbedded solution algorithm is provably optimal in the sense that it can solve a puzzle with n blocks in arbitrary arrangement in the fewest possible moves.
The Towers of Hanoi solution is a classic example of recursion. See <http://en.wikipedia.org/wiki/Tower_of_Hanoi#Logical_analysis_of_the_recursive_solution> for more information.
Citation pour cette source
Brian Moore (2024). Towers of Hanoi (https://www.mathworks.com/matlabcentral/fileexchange/38202-towers-of-hanoi), MATLAB Central File Exchange. Récupéré le .
Compatibilité avec les versions de MATLAB
Plateformes compatibles
Windows macOS LinuxCatégories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Découvrir Live Editor
Créez des scripts avec du code, des résultats et du texte formaté dans un même document exécutable.
Version | Publié le | Notes de version | |
---|---|---|---|
1.2.0.0 | Minor tweaks to code organization |
||
1.1.0.0 | Porting application to object-oriented framework |
||
1.0.0.0 |