记录式Hanoi塔非递归算法及快速仿真

A Non-recursive Algorithm and Simulation Based on Record Method for Hanoi Tower

Hanoi塔问题的递归算法虽然代码量小,但时间复杂度是指数级的且难以理解。本文分析了递归函数的调用参数和语句执行时盘子移动的顺序,提出一种新的自底向上非递归算法。该算法将求取盘子移动轨迹转化为单纯的字符替代,并利用开发环境中的基本控件即可快速实现该算法的仿真运行。

The code of the recursion algorithm for Hanoi tower problem is simple, but the time complexity is expo- nential and the code is difficult to understand. Based on the analysis of the reeursive function＇s parameters and statement exection the plates＇ moving track is geted. A new down-up non-recursive algorithm is put forward, this algorithm makes use of simple character replacement function instead of plate＇s moving track, and it also makes the program simulation easy and fast to be implemented by using some basic controls in a common development environ- ment.