Theory of Computing Systems

, Volume 54, Issue 4, pp 595–621

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

Article

DOI: 10.1007/s00224-013-9497-5

Cite this article as:
Viglietta, G. Theory Comput Syst (2014) 54: 595. doi:10.1007/s00224-013-9497-5

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 

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Carleton UniversityOttawaCanada

Personalised recommendations