Hanoi塔问题非递归的新算法  

A New Non-recursive Algorithm for the Tower of Hanoi Puzzle

作　　者：卢芳芳[1] 孙燮华[1] 仇苏恺[1] 郑林涛[1] 

机构地区：[1]中国计量学院计算机科学与技术系,杭州310018

出　　处：《计算机工程与应用》2006年第17期108-110,共3页Computer Engineering and Applications

摘　　要：关于Hanoi塔问题的非递归算法,已有了大量的研究[1￣4]。实验表明,当圆盘数目较少时,现有的非递归算法的执行速度比递归算法要快一些,但是随着圆盘数目的增加,现有的非递归算法的执行速度会逐渐变得比递归算法慢。论文提出了一种基于压缩编码的非递归新算法,在压缩了存储空间的同时,提高了算法的执行速度。实验结果表明,对于任意圆盘数目n,论文所实现的非递归算法的执行速度比现有的递归算法和非递归算法都有成倍的提高。There have been lots of researches on non-recursive algorithms for the tower of Hanoi puzzle.Experiment results show that the speed of the existing non-recursive algorithms is efficient when the number of the plates is small. But when the number of the plates becomes larger,the speed of the existing non-recursive algorithms becomes less efficient than the recursive algorithm.This paper proposes a new non-recursive algorithm,which based on compression code,for the tower of Hanoi puzzle.It compresses the memory space and improves the speed of execution of the algorithm.Experiment results show that the new algorithm is more efficient than the existing non-recursive algorithms and the recursive algorithm.

关 键 词：HANOI塔问题 递归算法 非递归算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]