THE TOWERS OF HANOI PROBLEM WITH PARALLEL MOVES

被引：11

作者：

WU, JS ^{[1
]}

CHEN, RJ ^{[1
]}

机构：

[1] NATL CHIAO TUNG UNIV,DEPT COMP SCI & INFORMAT ENGN,HSINCHU 30050,TAIWAN

来源：

INFORMATION PROCESSING LETTERS | 1992年 / 44卷 / 05期

关键词：

TOWERS OF HANOI; RECURRENCE RELATIONS; ALGORITHMS;

D O I：

10.1016/0020-0190(92)90207-C

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper proposes a variant of the towers of Hanoi problem allowing parallel moves. An algorithm for this problem is presented and proved to be optimal.

引用

页码：241 / 243

页数：3

共 50 条

[21] FAST ALGORITHM FOR THE TOWERS OF HANOI PROBLEM.
Gault, D.
Clint, M.
Computer Journal, 1987, 30 (04): : 376 - 378
[22] AN ITERATIVE SOLUTION TO THE GENERALIZED TOWERS OF HANOI PROBLEM
ER, MC
BIT, 1983, 23 (03): : 295 - 302
[23] A STATISTICAL-ANALYSIS OF THE TOWERS OF HANOI PROBLEM
CHAN, TH
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1989, 28 (1-4) : 57 - 65
[24] AN ITERATIVE ALGORITHM FOR THE CYCLIC TOWERS OF HANOI PROBLEM
ER, MC
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (02): : 123 - 129
[25] A SIMPLER ITERATIVE SOLUTION TO THE TOWERS OF HANOI PROBLEM
FRANKLIN, WR
SIGPLAN NOTICES, 1984, 19 (08): : 87 - 88
[26] A simple digital circuit for the Towers of Hanoi problem
Blair, GM
IEEE TRANSACTIONS ON EDUCATION, 1997, 40 (04) : 287 - 288
[27] The Towers of Hanoi
Morris, George C.
TEACHING MATHEMATICS AND ITS APPLICATIONS, 2007, 26 (04): : 179 - 186
[28] A LOOPLESS AND OPTIMAL ALGORITHM FOR THE CYCLIC TOWERS OF HANOI PROBLEM
ER, MC
INFORMATION SCIENCES, 1987, 42 (03) : 283 - 287
[29] “Problem of Towers of Hanoi”仿真软件的设计
周斌
实验室研究与探索, 2011, 30 (07) : 61 - 63+71
[30] Fast iterative algorithm for solving the Towers of Hanoi problem
Chang Sha Tie Dao Xue Yuan, 3 (39-43):

← 1 2 3 4 5 →