摘要
本文给出了汉诺 (Hanoi)塔问题的一种新的解模型。通过这个模型 ,完全找出了每一个圆盘的移动规律 ,从而得到一个与该问题传统的递归解在圆盘移动上完全一样 ,但效率更高 ,占用额外存储空间为零的非递归算法。
This paper gives a new resolution model about the Tower-of-Hanoi puzzle.According to this model,the laws of every number of disks’ moving was found completely.And based on the laws of disks’ moving,this paper puts forward a nonrecursive algorithm which is equal to traditional recursive resolution of this puzzle completely,but this algorithm is more efficient and it possess zero additional store space.
出处
《计算机应用与软件》
CSCD
北大核心
2004年第10期49-51,共3页
Computer Applications and Software
