Classic Nintendo Games Are (Computationally) Hard
Author(s)Aloupis, Greg; Demaine, Erik D.; Guo, Alan; Viglietta, Giovanni
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Fun with Algorithms
Aloupis, Greg, Erik D. Demaine, Alan Guo, and Giovanni Viglietta. “Classic Nintendo Games Are (Computationally) Hard.” Fun with Algorithms (2014): 40–51.
Author's final manuscript