par Burke, Kyle;Löffler, Maarten;Santiago, Aaron;Schmidt, Christiane;Uehara, Ryuhei;Uno, Yushi;Williams, Aaron;Demaine, Erik D. 
;Gregg, Harrison;Hearn, Robert R.A.;Hesterberg, Adam;Hoffmann, Michael;Ito, Hiro;Kostitsyna, Irina ;Leonard, Jody
Référence Lecture notes in computer science, 9943 LNCS, page (60-72)
Publication Publié, 2016
;Gregg, Harrison;Hearn, Robert R.A.;Hesterberg, Adam;Hoffmann, Michael;Ito, Hiro;Kostitsyna, Irina ;Leonard, JodyRéférence Lecture notes in computer science, 9943 LNCS, page (60-72)
Publication Publié, 2016
Article révisé par les pairs
| Résumé : | We study the computational complexity of the Buttons & Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for C = 2 colors but polytime solvable for C = 1. Similarly the game is NP-complete if every color is used by at most F = 4 buttons but polytime solvable for F ≤ 3. We also consider restrictions on the board size, cut directions, and cut sizes. Finally, we introduce several natural two-player versions of the game and show that they are PSPACE-complete. |
