TIME AND SPACE EFFICIENT ALGORITHM FOR THE CYCLIC TOWERS OF HANOI PROBLEM.

被引：0

|

作者：

Er, M.C. ^{[1
]}

机构：

[1] Univ of Western Australia, Nedlands, Aust, Univ of Western Australia, Nedlands, Aust

来源：

Journal of information processing | 1986年 / 9卷 / 03期

关键词：

CYCLIC TOWERS OF HANOI PROBLEM;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：163 / 165

相关论文

共 50 条

[41] A simple digital circuit for the Towers of Hanoi problem
Blair, GM
IEEE TRANSACTIONS ON EDUCATION, 1997, 40 (04) : 287 - 288
[42] THE GENERALIZED COLOR TOWERS OF HANOI - AN ITERATIVE ALGORITHM
ER, MC
COMPUTER JOURNAL, 1984, 27 (03): : 278 - 282
[43] The cyclic towers of Hanoi: An iterative solution produced by transformation
Gedeon, TD
COMPUTER JOURNAL, 1996, 39 (04): : 353 - 356
[44] “Problem of Towers of Hanoi”仿真软件的设计
周斌
实验室研究与探索, 2011, 30 (07) : 61 - 63+71
[45] An optimal algorithm to implement the Hanoi towers with parallel moves
Wu, JS
Wang, YK
INFORMATION PROCESSING LETTERS, 2003, 86 (06) : 289 - 293
[46] A more efficient heuristic algorithm for the large phylogeny Steiner problem.
Minaka, N
Yamamoto, H
Asano, T
Suemura, T
Machii, H
CLADISTICS-THE INTERNATIONAL JOURNAL OF THE WILLI HENNIG SOCIETY, 2003, 19 (02): : 157 - 157
[47] THE SUPER TOWERS OF HANOI PROBLEM - LARGE RINGS ON SMALL RINGS
KLEIN, CS
MINSKER, S
DISCRETE MATHEMATICS, 1993, 114 (1-3) : 283 - 295
[48] PERFORMANCE EVALUATIONS OF RECURSIVE AND ITERATIVE ALGORITHMS FOR THE TOWERS OF HANOI PROBLEM
ER, MC
COMPUTING, 1986, 37 (02) : 93 - 102
[49] EXACT ALGORITHM FOR THE TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM.
Baker, Edward K.
1600, (31):
[50] The generalized Towers of Hanoi for space-deficient computers and forgetful humans
Walsh, TR
MATHEMATICAL INTELLIGENCER, 1998, 20 (01): : 32 - 38

← 1 2 3 4 5 →