par Aloupis, Greg 
;Demaine, Erik D. ;Guo, Alan;Viglietta, Giovanni
Référence Lecture notes in computer science, 8496 LNCS, page (40-51)
Publication Publié, 2014
;Demaine, Erik D. ;Guo, Alan;Viglietta, GiovanniRéférence Lecture notes in computer science, 8496 LNCS, page (40-51)
Publication Publié, 2014
Article révisé par les pairs
| Résumé : | 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, 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. © 2014 Springer International Publishing. |
