Voltar
Capítulo de livro Acesso aberto Revisado por pares
BIBTEX RIS

Classic Nintendo Games Are (Computationally) Hard

2014; Springer Science+Business Media; Linguagem: Inglês

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

ISSN

1611-3349

Autores

Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta,

Tópico(s)

Educational Games and Gamification

Resumo

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.

Referência(s)