|
|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/15103
|
| タイトル: | Single-Player and Two-Player Buttons & Scissors Games |
| 著者: | Burke, Kyle
Demaine, Erik D.
Hearn, Robert A.
Hesterberg, Adam
Hoffman, Michael
Ito, Hiro
Kostitsyna, Irina
Loffler, Maarten
Uno, Yushi
Schmidt, Christiane
Uehara, Ryuhei
Williams, Aaron |
| キーワード: | Buttons and Scissors Game
Computational Complexity
PSPACE-completeness
NP-completeness |
| 発行日: | 2016-11-24 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 9943 |
| 開始ページ: | 60 |
| 終了ページ: | 72 |
| DOI: | 10.1007/978-3-319-48532-4_6 |
| 抄録: | The Buttons and Scissors puzzle was recently shown to be NP-hard. In this paper we continue studying the complexity of various versions of the puzzle. For example, we show that it is NP-hard when the puzzle consists of C=2 colors, and polytime solvable for C=1. Similarly, it is NP-hard when each color is used by at most F=4 buttons, and polytime solvable for F=3. We also consider restrictions on the board size, cut directions, and cut lengths. Finally, we introduce new two-player games and show that they are PSPACE-complete. |
| Rights: | This is the author-created version of Springer, Kyle Burke, Eri k D. Demaine, Robert A. Hearn, Adam Hesterberg, Michael Hoffman, Hiro Ito, Irina Kostitsyna, Maarten Loffler, Yushi Uno, Christiane Schmidt, Ryuhei Uehara and Aaron Williams, Lecture Notes in Computer Science, 9943, 2016, 60-72. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-48532-4_6 |
| URI: | http://hdl.handle.net/10119/15103 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 23592.pdf | | 1230Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
