THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES
| dc.citation.epage | 6 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 1 | en_US |
| dc.citation.volume | 46 | en_US |
| dc.citation.woscount | 2 | |
| dc.contributor.author | WU, JS | en_US |
| dc.contributor.author | CHEN, RJ | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:04:33Z | |
| dc.date.available | 2014-12-08T15:04:33Z | |
| dc.date.issued | 1993-04-29 | en_US |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1016/0020-0190(93)90187-E | en_US |
| dc.identifier.issn | 0020-0190 | en_US |
| dc.identifier.journal | INFORMATION PROCESSING LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/0020-0190(93)90187-E | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3043 | |
| dc.identifier.wosnumber | WOS:A1993LA61800001 | |
| dc.language.iso | en_US | en_US |
| dc.subject | TOWERS OF HANOI | en_US |
| dc.subject | RECURRENCE RELATIONS | en_US |
| dc.subject | ALGORITHMS | en_US |
| dc.title | THE TOWERS OF HANOI PROBLEM WITH CYCLIC PARALLEL MOVES | en_US |
| dc.type | Article | en_US |