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 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 g...
Main Authors: | Aloupis, Greg, Demaine, Erik D, Guo, Alan Xinyu, Viglietta, Giovanni |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Elsevier BV
2019
|
Online Access: | https://hdl.handle.net/1721.1/121347 |
Similar Items
-
Classic Nintendo Games Are (Computationally) Hard
by: Aloupis, Greg, et al.
Published: (2015) -
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) -
Can Nintendo get its crown back? : examining the dynamics of the U.S. video game console market
by: Chow, Samuel W
Published: (2008) -
Computing Signed Permutations of Polygon
by: Aloupis, Greg, et al.
Published: (2012)