Classic Nintendo Games Are (Computationally) Hard
Name
Demaine_Classic Nintendo.pdf
Size
3.24 MB
Format
Adobe PDF
Checksum (MD5)
227fecc3ae603ae89c7549c7a07ae30d
Author(s)
Aloupis, Greg
Demaine, Erik D.
Guo, Alan
Viglietta, Giovanni
Date Issued
2014
Journal
Fun with Algorithms
Publisher
Wiley Blackwell
Citation
Aloupis, Greg, Erik D. Demaine, Alan Guo, and Giovanni Viglietta. “Classic Nintendo Games Are (Computationally) Hard.” Fun with Algorithms (2014): 40–51.
Version
Author's final manuscript
Abstract
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon. 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 Pokemon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend of Zelda games.
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-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-07890-8_4
