readme.txt

以图形界面的方式形象的描述了数据结构中翰诺塔的过程

===============================================================================
Data Structures For Game Programmers
Ron Penton
Graphical Demonstration 10-1
===============================================================================
This demonstration shows you how to solve the towers of Hanoi using recursion

- When the demo starts, there are three discs on the first stack.
- You can change the number of discs to up to 10 by editing the Discs textbox.
- Click Reset after you change the number of discs
- set the number of milliseconds delay you want inbetween moves in the Delay
  textbox, and then click "Set Delay". You may change this value even when
  the solution is running.
- Click the Solve button to solve the puzzle.
- When the demo is over, you may click Reset again to reset it.