| 4杆汉诺塔问题 |
| |
| 引用本文： | 许维美,许道云. 4杆汉诺塔问题[J]. 铜仁学院学报, 2011, 13(1): 124-127,144 |
| |
| 作者姓名： | 许维美 许道云 |
| |
| 作者单位： | 1. 贵州大学科技学院,贵州,贵阳,550004
2. 贵州大学计算机科学与信息学院,贵州贵阳,550025 |
| |
| 摘 要： | 通常汉诺塔问题只考虑带3根杆,当圆盘数为n时,最佳方案的移动次数为J（n）=2^m-1。本文考虑带4杆的汉诺塔问题及其移动方案[（1-a）,a,0,0]。一个有趣的问题是：对于0〈a〈1,当口取什么值时,[（1-a）,a,0,0]-方案是最优的？实验表明：最优[（1-a）,a,0,0]-方案中,随着圆盘数n的增加,a值越大。当n≥240时,最优方案的a值稳定在0．9。
|
| 关 键 词： | 4杆汉诺塔问题 移动次数 最优移动方案 |
The Hanoi-tower Problem with More Poles |
| |
| XU Wei-mei,XU Dao-yun. The Hanoi-tower Problem with More Poles[J]. Journal of Tongren University, 2011, 13(1): 124-127,144 |
| |
| Authors: | XU Wei-mei XU Dao-yun |
| |
| Affiliation: | XU Wei-mei1,XU Dao-yun2(1.School of Science and Technology,Guizhou University,XiaoGuan,Guiyang,Guizhou 550004,China,2.School of Science and Technology,China) |
| |
| Abstract: | The usual Hanoi-tower game is played with three poles.The optimal moving number is in the game with n discs.In this paper,the Hanoi-tower problem with four poles is considered,and the corresponding solution is given.An interesting problem is how to take-value() would make the solution to be an optimal.The experiments show that is greater as the number of disc n increased in the optimal solution.And value in the optimal solution will stables at 0.9 for. |
| |
| Keywords: | the Hanoi-tower problem moving number optimal moving solutions |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
