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, collecting items, doors activated by switches 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, Deflektor, Mindbender, Pipe Mania, Skweek, Prince of Persia, Lemmings, Doom, Puzzle Bobble 3, and Starcraft. We obtain both new results, and improvements or alternative proofs of previously known results. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Viglietta, G. (2012). Gaming is a hard job, but someone has to do it! In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7288 LNCS, pp. 357–367). https://doi.org/10.1007/978-3-642-30347-0_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
