TOWERS OF HANOI REVISITED - A NONRECURSIVE SURPRISE

被引：1

|

作者：

MAYER, H ^{[1
]}

PERKINS, D ^{[1
]}

机构：

[1] SAN DIEGO STATE UNIV,DEPT MATH SCI,SAN DIEGO,CA 92182

来源：

SIGPLAN NOTICES | 1984年 / 19卷 / 02期

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：80 / 84

页数：5

相关论文

共 50 条

[41] THE COMPLEXITY OF THE GENERALIZED CYCLIC TOWERS OF HANOI PROBLEM
ER, MC
JOURNAL OF ALGORITHMS, 1985, 6 (03) : 351 - 358
[42] A BIOLOGICAL MODEL SOLUTION TO THE TOWERS OF HANOI PROBLEM
BAER, RM
COMPUTER JOURNAL, 1986, 29 (04): : 381 - 382
[43] A GENERALIZATION OF THE CYCLIC TOWERS OF HANOI - AN ITERATIVE SOLUTION
ER, MC
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1984, 15 (02) : 129 - 140
[44] A New Lower Bound for the Towers of Hanoi Problem
Grosu, Codrut
ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (01):
[45] ITERATION STRIKES BACK - AT THE CYCLIC TOWERS OF HANOI
WALSH, TR
INFORMATION PROCESSING LETTERS, 1983, 16 (02) : 91 - 93
[46] THE FUNDAMENTALLY RECURSIVE NATURE OF THE TOWERS OF HANOI PROBLEM
FOURNIER, JC
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1990, 24 (01): : 17 - 35
[47] COUNTER EXAMPLES TO ADJUDICATING A TOWERS OF HANOI CONTEST
ER, MC
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1987, 21 (02) : 123 - 131
[48] THE TOWERS OF HANOI - A REPRESENTATION-FREE SOLUTION
ROHL, JS
SIGPLAN NOTICES, 1987, 22 (03): : 126 - 126
[49] THE TOWERS OF HANOI RAINBOW PROBLEM - COLORING THE RINGS
MINSKER, S
JOURNAL OF ALGORITHMS, 1989, 10 (01) : 1 - 19
[50] FAST ALGORITHM FOR THE TOWERS OF HANOI PROBLEM.
Gault, D.
Clint, M.
Computer Journal, 1987, 30 (04): : 376 - 378

← 1 2 3 4 5 →