“Problem of Towers of Hanoi”仿真软件的设计

摘要

"Problem of Towers of Hanoi" is a problem can be easily solved with recursion, but it is difficult to do with nonrecursion, because with the growing participation of the disk number, the computation time and complexity will be increasing.;The use of the simulation software can clear outline each disk and gives details of the trajectory of the movement of steps, which will make this problem more vivid, more intuitive to be solved.%“Problem of Towers of Hanoi”,用递归的方法能很容易地解决问题,不用递归的方法将会是比较困难,因为随着参与盘子数的不断增多,计算时间和复杂度将会不断增多.运用仿真软件能清晰地勾勒出每个盘子的移动轨迹并给出详细的移动步骤,这将会使此问题能更形象、更直观的解决.