汉诺塔问题的非递归新解法  

A New Non-Recursive Algorithm of Hanoi Tower Problem

作　　者：熊小兵[1] 苏光奎[1] 

机构地区：[1]武汉大学计算机学院,武汉430079

出　　处：《三峡大学学报（自然科学版）》2004年第4期375-378,共4页Journal of China Three Gorges University：Natural Sciences

摘　　要：汉诺塔问题是计算机算法设计中经常被大家引用来说明递归算法的一个经典问题.长期以来,很多人一直认为这个问题只能用递归方法求解.从讨论汉诺塔问题的几个基本特性入手,通过分析和归纳总结,提出了一种全新的解决汉诺塔问题的简洁而又高效的非递归解法,并用具体的实例对其进行了验证.Hanoi Tower problem is a classical mathematic problem and usually used to illustrate recursive algorithm in programming. For a long time, many people have been holding that only using recursive algorithm can we solve this problem. This is not the case. As so far, some people have done great work for this problem and presented some practical non-recursive algorithms. Starting with some basic features of Hanoi Tower problem, this paper puts forward a new simple and efficient non-recursive algorithm of this problem based on some basic conclusions derived from the basic features. In order to examine the algorithm,a concrete example is given.

关 键 词：汉诺塔问题 递归算法 计算机算法 递归方法 验证 设计 引用 解法 归纳总结 基本特性 

分 类 号：G633[文化科学—教育学] TP301.6[自动化与计算机技术—计算机系统结构]