Gaming Is a Hard Job, but Someone Has to Do It!

We establish some general schemes relating the computational complexity of a video game to the presence of certain common elements or mechanics, such as destroyable paths, collectible items, doors opened by keys or activated by buttons or pressure plates, etc. Then we apply such “metatheorems” to several video games published between 1980 and 1998, including Pac-Man, Tron, Lode Runner, Boulder Dash, Pipe Mania, Skweek, Prince of Persia, Lemmings, and Starcraft. We obtain both new results, and improvements or alternative proofs of previously known results.

[1]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[2]  U. Dulleck,et al.  μ-σ Games , 2012, Games.

[3]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[4]  Giovanni Viglietta.  Lemmings is PSPACE-complete , 2015, Theor. Comput. Sci..

[5]  Tillmann Miltzow.  Tron, a Combinatorial Game on Abstract Graphs , 2012, FUN.

[6]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[7]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[8]  Erik D. Demaine,et al.  Games of No Chance 3: Playing games with algorithms: Algorithmic combinatorial game theory , 2009 .

[9]  Sergey Yekhanin,et al.  Towards 3-query locally decodable codes of subexponential length , 2008, JACM.

[10]  Giovanni Viglietta.  Gaming Is a Hard Job, But Someone Has to Do It! , 2012, FUN.

[11]  Erik D. Demaine,et al.  Games, puzzles and computation , 2009 .

[12]  Graham Cormode,et al.  The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs" , 2004 .

[13]  Erik D. Demaine,et al.  Playing Games with Algorithms: Algorithmic Combinatorial Game Theory , 2001, MFCS.

[14]  Ján Plesník,et al.  The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two , 1979, Inf. Process. Lett..

[15]  Michal Forisek.  Computational Complexity of Two-Dimensional Platform Games , 2010, FUN.

[16]  Graham Kendall,et al.  A Survey of NP-Complete Puzzles , 2008, J. Int. Comput. Games Assoc..