WEKO3
アイテム
The Parameterized Complexity of Ricochet Robots
https://ipsj.ixsq.nii.ac.jp/records/183011
https://ipsj.ixsq.nii.ac.jp/records/1830110919e7e5-68a3-4054-8aac-6b62118f7958
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5808025.pdf (1.7 MB)
|
Copyright (c) 2017 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2017-08-15 | |||||||||
| タイトル | ||||||||||
| タイトル | The Parameterized Complexity of Ricochet Robots | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | The Parameterized Complexity of Ricochet Robots | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：離散と計算の幾何・グラフ・ゲーム] Computational Complexity, Parameterized Complexity | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Massachusetts Institute of Technology, CSAIL | ||||||||||
| 著者所属 | ||||||||||
| Massachusetts Institute of Technology, CSAIL | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Massachusetts Institute of Technology, CSAIL | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Massachusetts Institute of Technology, CSAIL | ||||||||||
| 著者名 |
Adam, Hesterberg
× Adam, Hesterberg
× Justin, Kopinsky
|
|||||||||
| 著者名(英) |
Adam, Hesterberg
× Adam, Hesterberg
× Justin, Kopinsky
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Sliding maze puzzles like Ricochet Robots and Atomix are puzzles in which solvers must maneuver agents around a grid board subject to the constraint that whenever an agent moves in some direction, it must move as far as possible in that direction. In general, finding an optimal solution to these puzzles is known to be PSPACE-complete. This paper further shows that these puzzles are W[SAT]-hard with respect to the number of robots in the puzzle instance (and therefore unlikely to be Fixed Parameter Tractable). ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.716 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Sliding maze puzzles like Ricochet Robots and Atomix are puzzles in which solvers must maneuver agents around a grid board subject to the constraint that whenever an agent moves in some direction, it must move as far as possible in that direction. In general, finding an optimal solution to these puzzles is known to be PSPACE-complete. This paper further shows that these puzzles are W[SAT]-hard with respect to the number of robots in the puzzle instance (and therefore unlikely to be Fixed Parameter Tractable). ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.25(2017) (online) DOI http://dx.doi.org/10.2197/ipsjjip.25.716 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 58, 号 8, 発行日 2017-08-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
