推广的四柱Hanoi塔问题的求解算法及时间复杂度分析  

Popularization and Solution Algorithm on the Problem of Four-pole Hanoi Tower

作　　者：赵天玉[1] 

机构地区：[1]长江大学信息与数学学院,湖北荆州434023

出　　处：《长江大学学报（自然科学版）》2004年第2期55-57,共3页Journal of Yangtze University(Natural Science Edition)

摘　　要：对标准的四柱Hanoi塔问题作了改型和变化,就圆盘大小和个数进行了推广,并对这种推广的四 柱Hanoi塔问题给出了求解算法及时问复杂度分析。The problem of standard four-pole Hanoi tower is modified and changed. The size and number of its disks are popularized. An algorithm for finding the solutions for the problems of popularization of the four-pole Hanoi tower is put forward and an analysis is made on the time complexity.

关 键 词：四柱Hanoi塔 算法 时间复杂度 递归技术 

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