Gaming Is a Hard Job, But Someone Has to Do It!
2012; Springer Science+Business Media; Linguagem: Inglês
10.1007/978-3-642-30347-0_35
ISSN1611-3349
Autores Tópico(s)Computability, Logic, AI Algorithms
ResumoWe 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.
Referência(s)