摘要
对“汉诺塔问题”的最少移动次数及实现最少移动次数的方案数量进行了研究 ,并证明了实现最少移动次数的方案是唯一的 .
The paper studies the least shift frequency of 'Hanoi Tower'Issue and the plan quantity of achieving it and confirms that the plan quantity of achieving the least shift frequency is one and only.
出处
《廊坊师范学院学报》
2001年第4期50-51,共2页
Journal of Langfang Teachers College
关键词
汉诺塔
数学归纳法
递归
Hanoi Tower Issue
mathematical induction
recursion
