Classic Nintendo Games Are (Computationally) Hard

Classic Nintendo Games Are (Computationally) Hard

Show other versions (1)

We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon. 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; a...

Full description

Bibliographic Details
Main Authors: Aloupis, Greg, Demaine, Erik D., Guo, Alan, Viglietta, Giovanni
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Wiley Blackwell 2015
Online Access:http://hdl.handle.net/1721.1/99991
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/99991
https://orcid.org/0000-0003-3803-5703

Similar Items