Classic Nintendo Games Are (Computationally) Hard

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.

DOI: 10.1007/978-3-319-07890-8_4

Extracted Key Phrases

35 Figures and Tables

Cite this paper

@inproceedings{Aloupis2014ClassicNG, title={Classic Nintendo Games Are (Computationally) Hard}, author={Greg Aloupis and Erik D. Demaine and Alan Guo and Giovanni Viglietta}, booktitle={FUN}, year={2014} }