THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES

標題:	THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES
作者:	WU, JS CHEN, RJ 交大名義發表資訊工程學系 National Chiao Tung University Department of Computer Science
關鍵字:	TOWERS OF HANOI;RECURRENCE RELATIONS;ALGORITHMS
公開日期:	29-四月-1993
摘要:	This paper discusses a variant of the towers of Hanoi problem with cyclic parallel moves. We propose an algorithm for this problem and show that the algorithm is optimal.
URI:	http://dx.doi.org/10.1016/0020-0190(93)90187-E http://hdl.handle.net/11536/3043
ISSN:	0020-0190
DOI:	10.1016/0020-0190(93)90187-E
期刊:	INFORMATION PROCESSING LETTERS
Volume:	46
Issue:	1
起始頁:	1
結束頁:	6
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。