Samenvatting
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 Fbackslashle 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.
| Originele taal-2 | Engels |
|---|---|
| Titel | Discrete and Computational Geometry and Graphs : 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015 : Revised Selected Papers |
| Redacteuren | Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno |
| Plaats van productie | Dordrecht |
| Uitgeverij | Springer |
| Pagina's | 60-72 |
| Aantal pagina's | 13 |
| ISBN van elektronische versie | 978-3-319-48532-4 |
| ISBN van geprinte versie | 978-3-319-48531-7 |
| DOI's | |
| Status | Gepubliceerd - 2016 |
| Extern gepubliceerd | Ja |
| Evenement | 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015) - Kyoto, Japan Duur: 14 sep. 2015 → 16 sep. 2015 Congresnummer: 18 |
Publicatie series
| Naam | Lecture Notes in Computer Science |
|---|---|
| Volume | 9943 |
Congres
| Congres | 18th Japan Conference on Discrete and Computational Geometry and Graphs (JCDCGG 2015) |
|---|---|
| Verkorte titel | JCDCGG 2015 |
| Land/Regio | Japan |
| Stad | Kyoto |
| Periode | 14/09/15 → 16/09/15 |
Vingerafdruk
Duik in de onderzoeksthema's van 'Single-player and two-player buttons & scissors games (extended abstract)'. Samen vormen ze een unieke vingerafdruk.Citeer dit
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver