Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-07890-8_4 | Theor. Comput. Sci. |
DocType | Volume | Issue |
Conference | 586 | C |
ISSN | Citations | PageRank |
0302-9743 | 8 | 0.59 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Greg Aloupis | 1 | 200 | 26.50 |
| Erik D. Demaine | 2 | 4624 | 388.59 |
| Alan Guo | 3 | 62 | 7.96 |
| Giovanni Viglietta | 4 | 164 | 19.82 |