Classic Nintendo Games are (Computationally) Hard
2012/03/08 by Greg Aloupis, Erik D. Demaine, Aloupis, Greg +5 · 12 voices
#cs.CC #cs.GT
paper · pdf · doi:10.48550/arxiv.1203.1895
Abstract
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, The Lost Levels, and Super Mario World; Donkey Kong Country 1-3; all Legend of Zelda games; all Metroid games; and all Pokemon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend of Zelda games.
Discussions
- Classic Nintendo Games Are NP-Hard (2012) [hn, 115 points, 59 comments]
- Classic Nintendo Games are (NP-)Hard [hn, 16 points, 0 comments]
- Classic Nintendo Games are (NP-)Hard [hn, 10 points, 0 comments]
- Classic Nintendo Games are (NP-)Hard [hn, 4 points, 0 comments]
- Proof that NES games are NP-hard [pdf] [hn, 3 points, 1 comments]
- Classic Nintendo Games are (Computationally) Hard [lobsters, 3 points, 0 comments]
- Classic Nintendo Games are (NP-)Hard [lobsters, 2 points, 0 comments]
- Classic Nintendo Games are (Computationally) Hard [lobsters, 2 points, 0 comments]
- Classic Nintendo Games Are Computationally Hard [hn, 2 points, 0 comments]
- Classic Nintendo Games are (NP-)Hard (and Mario is NP-Complete) [hn, 2 points, 0 comments]
- Interesting paper: Classic Nintendo Games are (NP-)Hard [hn, 2 points, 0 comments]
- Classic Nintendo Games are (Computationally) Hard [pdf] [hn, 1 points, 0 comments]
Related