Skip to main content
Log in

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

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  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. 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)

    Chapter  Google Scholar 

  3. Forišek, M.: Computational complexity of two-dimensional platform games. In: Proceedings of FUN’10, pp. 214–226 (2010)

    Google Scholar 

  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. Hearn, R.A., Demaine, E.D.: Games, Puzzles, and Computation. AK Peters, Wellesley (2009)

    MATH  Google Scholar 

  6. Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA J. 31, 13–34 (2008)

    Google Scholar 

  7. Miltzow, T.: Tron, a combinatorial game on abstract graphs. In: Proceedings of FUN’12, pp. 293–304 (2012)

    Google Scholar 

  8. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  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)

    Article  MATH  Google Scholar 

  10. Reingold, O.: Undirected connectivity in log-space. J. ACM 55, 1–24 (2008)

    Article  MathSciNet  Google Scholar 

  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 

Download references

Acknowledgements

The author wishes to thank the anonymous reviewers for reading this paper carefully and making several suggestions to improve its presentation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giovanni Viglietta.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Viglietta, G. Gaming Is a Hard Job, but Someone Has to Do It!. Theory Comput Syst 54, 595–621 (2014). https://doi.org/10.1007/s00224-013-9497-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-013-9497-5

Keywords

Navigation