Towers Of Hanoi
by Brian Moore
17 Sep 2012
A MATLAB GUI application of the popular Towers Of Hanoi puzzle game with manual or auto solution.
|
Watch this File
|
| File Information |
| Description |
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. |
| Required Products |
MATLAB
|
| MATLAB release |
MATLAB 7.8 (R2009a)
|
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
|
Contact us
