基于递归关系下的Hanoi塔问题研究  

The study of Towers of Hanoi Puzzle on the recursive relation

作　　者：周武[1] 陈声利[1] 谢辉[1] 

机构地区：[1]西南民族大学计科学院数学系,四川成都610041

出　　处：《西南民族大学学报（自然科学版）》2009年第5期931-936,共6页Journal of Southwest Minzu University(Natural Science Edition)

摘　　要：本文从标准Hanoi塔问题出发,以发散性思维深入研究了一般化的Hanoi塔问题,并进行了严格的数学推理论证,最终得到各类问题的公式解.本文实现了基于递归关系下的数学推理,得到了较为乐观的结论,为算法分析与数学分支领域提供了参考意义.Based on the standard Tower of Hanoi problem, this paper deeply studies the general Towers of Hanoi problems by way of divergent thinking and recursive thinking. After strict mathematical induction and reasoning, we obtain the formula solutions of general Towers of Hanoi problems, which provide important reference value on recursive relation in the field of Algorithm Analysis and Combinatorial Mathematics.

关 键 词：HANOI塔 递归关系 整体思想 公式解 

分 类 号：O157[理学—数学]