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.

DOI: 10.1007/s00224-013-9497-5

Extracted Key Phrases

1 Figure or Table

Cite this paper

@article{Viglietta2012GamingIA, title={Gaming Is a Hard Job, but Someone Has to Do It!}, author={Giovanni Viglietta}, journal={Theory of Computing Systems}, year={2012}, volume={54}, pages={595-621} }