The Generalized Problem of Hanoi Tower And Its Optimal Solving Algorithm
Author:
Affiliation:
Fund Project:
摘要
|
图/表
|
访问统计
|
参考文献
|
相似文献
|
引证文献
|
资源附件
|
文章评论
摘要:
本文通过研究广义 Hanoi 塔问题,揭示了其求解过程中圆盘移动的最佳次序,提出了相应的最佳求解算法;并通过分析其算法的复杂度,给出了 n 阶广义 Hanoi 塔问题的最佳通解。
Abstract:
Through researching into the generalized problem of Hanoi tower,this paper has revealed the optimal removing sequence of the circle plates during its solving procedure. And through analyzing the algorithm complexity,this paper has put forward an optimal solving algorithm and drawn into an optimal general solution.
参考文献
相似文献
引证文献
引用本文
张光铎,王正志.广义 Hanoi 塔问题及其最佳求解算法研究[J].国防科技大学学报,1996,18(2):124-129. Zhang Guangduo, Wang Zhengzhi. The Generalized Problem of Hanoi Tower And Its Optimal Solving Algorithm[J]. Journal of National University of Defense Technology,1996,18(2):124-129.