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 条
  • [1] THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES
    WU, JS
    CHEN, RJ
    INFORMATION PROCESSING LETTERS, 1993, 46 (01) : 1 - 6
  • [2] An optimal algorithm to implement the Hanoi towers with parallel moves
    Wu, JS
    Wang, YK
    INFORMATION PROCESSING LETTERS, 2003, 86 (06) : 289 - 293
  • [3] THE TOWERS OF HANOI PROBLEM
    ROHL, JS
    COMPUTER JOURNAL, 1985, 28 (03): : 350 - 350
  • [4] THE TOWERS OF HANOI PROBLEM
    BUNEMAN, P
    LEVY, L
    INFORMATION PROCESSING LETTERS, 1980, 10 (4-5) : 243 - 244
  • [5] On the solution of the towers of Hanoi problem
    Ahrabian, Hayedeh
    Badamchi, Comfar
    Nowzari-Dalini, Abbass
    World Academy of Science, Engineering and Technology, 2011, 73 : 89 - 92
  • [6] NOTE ON TOWERS OF HANOI PROBLEM
    HAYES, PJ
    COMPUTER JOURNAL, 1977, 20 (03): : 282 - 285
  • [7] THE TOWERS OF HANOI REVISITED - MOVING THE RINGS BY COUNTING THE MOVES
    WALSH, TR
    INFORMATION PROCESSING LETTERS, 1982, 15 (02) : 64 - 67
  • [8] What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?
    Demontis, Roberto
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2019, 11 (01)
  • [9] The word problem in Hanoi Towers groups
    Bondarenko, Ievgen
    ALGEBRA & DISCRETE MATHEMATICS, 2014, 17 (02): : 248 - 255
  • [10] A FAST ALGORITHM FOR THE TOWERS OF HANOI PROBLEM
    GAULT, D
    CLINT, M
    COMPUTER JOURNAL, 1987, 30 (04): : 376 - 378
12345