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

Full description

Bibliographic Details
Main Authors: Aloupis, Greg (Author), Demaine, Erik D. (Contributor), Guo, Alan (Contributor), Viglietta, Giovanni (Author)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Wiley Blackwell, 2015-11-23T15:35:10Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items