Theory of Computing Systems

, Volume 54, Issue 4, pp 595–621

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

Article

Abstract

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.

Keywords

Complexity Games Pac-Man Tron Starcraft 

References

  1. 1.
    Cormode, G.: The hardness of the Lemmings game, or Oh no, more NP-completeness proofs. In: Proceedings of FUN’04, pp. 65–76 (2004) Google Scholar
  2. 2.
    Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory. In: Albert, M.H., Nowakowski, R.J. (eds.) Games of No Chance 3. MSRI Publications, vol. 56, pp. 3–56 (2009) CrossRefGoogle Scholar
  3. 3.
    Forišek, M.: Computational complexity of two-dimensional platform games. In: Proceedings of FUN’10, pp. 214–226 (2010) Google Scholar
  4. 4.
    Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of STOC’74, pp. 47–63 (1974) Google Scholar
  5. 5.
    Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. AK Peters, Wellesley (2009) MATHGoogle Scholar
  6. 6.
    Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA J. 31, 13–34 (2008) Google Scholar
  7. 7.
    Miltzow, T.: Tron, a combinatorial game on abstract graphs. In: Proceedings of FUN’12, pp. 293–304 (2012) Google Scholar
  8. 8.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994) MATHGoogle Scholar
  9. 9.
    Plesńik, J.: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Inf. Process. Lett. 8, 199–201 (1979) CrossRefMATHGoogle Scholar
  10. 10.
    Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1–24 (2008) CrossRefMathSciNetGoogle Scholar
  11. 11.
    Viglietta, G.: Gaming is a hard job, but someone has to do it! In: Proceedings of FUN’12, pp. 357–367 (2012) Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Carleton UniversityOttawaCanada

Personalised recommendations