WEKO3
アイテム
A Time and Space Efficient Algorithm for the Cyclic Towers of Hanoi Problem
https://ipsj.ixsq.nii.ac.jp/records/59847
https://ipsj.ixsq.nii.ac.jp/records/5984711dca748-257c-473b-89a0-19d3888f395a
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JIP0903007.pdf (302.4 kB)
|
Copyright (c) 1986 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | JInfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1986-01-31 | |||||||
| タイトル | ||||||||
| タイトル | A Time and Space Efficient Algorithm for the Cyclic Towers of Hanoi Problem | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | A Time and Space Efficient Algorithm for the Cyclic Towers of Hanoi Problem | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of Computer Science The University of Western Australia | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, The University of Western Australia | ||||||||
| 著者名 |
M.C.Er
× M.C.Er
|
|||||||
| 著者名(英) |
M.C., Er
× M.C., Er
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper reports a time and space efficient algorithm for solving the cyclic Towers of Hanoi problem. The space Complexity of the algorithm is θ(n) where n is the number of discs. The time complexity of the algorithm is bounded by a constant per disc move. An empirical test confirms that this algorithm is the fastest iterative algorithm for solving the cyclic Towers of Hanoi problem. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | This paper reports a time and space efficient algorithm for solving the cyclic Towers of Hanoi problem. The space Complexity of the algorithm is θ(n), where n is the number of discs. The time complexity of the algorithm is bounded by a constant per disc move. An empirical test confirms that this algorithm is the fastest iterative algorithm for solving the cyclic Towers of Hanoi problem. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00700121 | |||||||
| 書誌情報 |
Journal of Information Processing 巻 9, 号 3, p. 163-165, 発行日 1986-01-31 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6652 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
