Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract)

@inproceedings{Burke2015SinglePlayerAT,
  title={Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract)},
  author={Kyle Burke and Erik D. Demaine and Harrison Gregg and Robert A. Hearn and Adam Hesterberg and Michael Hoffmann and Hiro Ito and Irina Kostitsyna and Jody Leonard and Maarten L{\"o}ffler and Aaron Santiago and Christiane Schmidt and Ryuhei Uehara and Yushi Uno and Aaron Williams},
  booktitle={JCDCGG},
  year={2015}
}
  • Kyle Burke, Erik D. Demaine, +12 authors Aaron Williams
  • Published in JCDCGG 2015
  • Mathematics, Computer Science
  • 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\le 3\). We also consider restrictions on the board size, cut directions, and cut sizes. Finally, we introduce several natural two-player versions of… CONTINUE READING
    4
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-6 OF 6 REFERENCES

    Packing subgraphs in a graph

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    Planar Formulae and Their Uses

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    The Problem of Compatible Representatives

    GO Is Polynomial-Space Hard

    VIEW 1 EXCERPT

    On the Complexity of Some Two-Person Perfect-Information Games

    VIEW 1 EXCERPT