Abstract
We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon. Our results apply to generalized versions of Super Mario Bros. 1, 3, Lost Levels, and Super Mario World; Donkey Kong Country 1-3; all Legend of Zelda games; all Metroid games; and all Pokémon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend of Zelda games. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Aloupis, G., Demaine, E. D., Guo, A., & Viglietta, G. (2014). Classic Nintendo games are (computationally) hard. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8496 LNCS, pp. 40–51). Springer Verlag. https://doi.org/10.1007/978-3-319-07890-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
