Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computational Complexity

arXiv:2302.01145 (cs)
[Submitted on 2 Feb 2023]

Title:This Game Is Not Going To Analyze Itself

Authors:Aviv Adler, Hayashi Ani, Lily Chung, Michael Coulombe, Erik D. Demaine, Jenny Diomidova, Dylan Hendrickson, Jayson Lynch
View PDF
Abstract: We analyze the puzzle video game This Game Is Not Going To Load Itself, where the player routes data packets of three different colors from given sources to given sinks of the correct color. Given the sources, sinks, and some previously placed arrow tiles, we prove that the game is in Sigma_2^P; in NP for sources of equal period; NP-complete for three colors and six equal-period sources with player input; and even without player input, simulating the game is both NP- and coNP-hard for two colors and many sources with different periods. On the other hand, we characterize which locations for three data sinks admit a perfect placement of arrow tiles that guarantee correct routing no matter the placement of the data sources, effectively solving most instances of the game as it is normally played.
Comments: 23 pages, 23 figures. Presented at JCDCGGG 2022
Subjects: Computational Complexity (cs.CC); Combinatorics (math.CO)
Cite as: arXiv:2302.01145 [cs.CC]
  (or arXiv:2302.01145v1 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.2302.01145

Submission history

From: Erik Demaine [view email]
[v1] Thu, 2 Feb 2023 15:00:59 UTC (8,850 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.CC
< prev   |   next >
new | recent | 2023-02
Change to browse by:
cs
math
math.CO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)