• Citer

Classic Nintendo games are (computationally) hard

par Aloupis, Greg ;Demaine, Erik D. ;Guo, Alan;Viglietta, Giovanni
Référence Theoretical computer science, 586, page (135-160)
Publication Publié, 2015-06

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

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, 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.