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
关键词
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 条