Classic Nintendo Games Are (Computationally) Hard
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...
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 |
Similar Items
-
Classic Nintendo games are (computationally) hard
by: Aloupis, Greg, et al.
Published: (2019) -
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
by: Demaine, Erik D, et al.
Published: (2019) -
Super Mario Bros. Is Harder/Easier than We Thought
by: Demaine, Erik D., et al.
Published: (2016) -
Computing Signed Permutations of Polygon
by: Aloupis, Greg, et al.
Published: (2012) -
Nintendo Wii Game in Balance Stroke Rehabilitation: A Narrative Review
by: Javid Mostamand, et al.
Published: (2020-03-01)