|
|||||
|
|
| 再谈Hanoi问题 | |
| 作者单位： | 常德师范学院计算机系!湖南常德，415000 |
| 摘 要： | Hanoi问题是一个经典例子．通过采用递归树方法求解精确移动次数． |
| 关 键 词： | Hanoi 递归 精确次数 |
On the Towers of Hanoi |
|
| Huang Tie. On the Towers of Hanoi[J]. Journal of Hunan University of Arts and Science:Social Science Edition, 1999, 0(3) | |
| Authors: | Huang Tie |
| Abstract: | The question of Hanoi is a typical example. The moving numbers gained by using a recursive tree in this article. |
| Keywords: | Hanoi Recursive Precise number |
| 本文献已被 CNKI 等数据库收录！ | |