Single-Player and Two-Player Buttons & Scissors Games

Single-Player and Two-Player Buttons & Scissors Games

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...

Full description

Bibliographic Details
Main Authors: Burke, Kyle (Author), Gregg, Harrison (Author), Hearn, Robert A. (Author), Hoffmann, Michael (Author), Ito, Hiro (Author), Kostitsyna, Irina (Author), Leonard, Jody (Author), Löffler, Maarten (Author), Santiago, Aaron (Author), Schmidt, Christiane (Author), Uehara, Ryuhei (Author), Uno, Yushi (Author), Williams, Aaron (Author), Demaine, Erik D (Contributor), Hesterberg, Adam Classen (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor)
Format: Article
Language:English
Published: Springer, 2018-04-17T18:25:04Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items