|
|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/15103
|
| Title: | Single-Player and Two-Player Buttons & Scissors Games |
| Authors: | 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 |
| Keywords: | Buttons and Scissors Game Computational Complexity PSPACE-completeness NP-completeness |
| Issue Date: | 2016-11-24 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 9943 |
| Start page: | 60 |
| End page: | 72 |
| DOI: | 10.1007/978-3-319-48532-4_6 |
| Abstract: | 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: | https://hdl.handle.net/10119/15103 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
| 23592.pdf | | 1230Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|