Gaming Is a Hard Job, but Someone Has to Do It!
- 367 Downloads
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.
KeywordsComplexity Games Pac-Man Tron Starcraft
The author wishes to thank the anonymous reviewers for reading this paper carefully and making several suggestions to improve its presentation.
- 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
- 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
- 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
- 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