Classic Nintendo Games Are (Computationally) Hard

Author(s)
Aloupis, Greg; Demaine, Erik D.; Guo, Alan; Viglietta, Giovanni
Thumbnail
DownloadDemaine_Classic Nintendo.pdf (3.241Mb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2014
URI
http://hdl.handle.net/1721.1/99991
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-3-319-07889-2
978-3-319-07890-8
ISSN
0302-9743
1611-3349
Collections