Classic Nintendo games are (computationally) hard
Name
1203.1895.pdf
Description
Submitted version
Size
3.43 MB
Format
Adobe PDF
Checksum (MD5)
877548f3ffc366957219011d15016d41
Author(s)
Aloupis, Greg
Demaine, Erik D
Guo, Alan Xinyu
Viglietta, Giovanni
Date Issued
June 2015
Journal
Theoretical Computer Science
Publisher
Elsevier BV
Citation
Aloupis, Greg et al. "Classic Nintendo games are (computationally) hard." Theoretical Computer Science 586 (June 2015): 135-160 © 2015 Elsevier B.V.
Version
Original manuscript
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, The 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. Keywords:
Nintendo games; Video games; Computational complexity; NP-hardness; PSPACE-hardness
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.tcs.2015.02.037
