Classic Nintendo Games Are (Computationally) Hard

@inproceedings{Aloupis2014ClassicNG,
  title={Classic Nintendo Games Are (Computationally) Hard},
  author={Greg Aloupis and Erik D. Demaine and Alan Guo and Giovanni Viglietta},
  booktitle={FUN},
  year={2014}
}
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 games; all Metroid games; and all Pokémon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend of Zelda games. 
Highly Cited
This paper has 42 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1,228 times over the past 90 days. VIEW TWEETS
21 Extracted Citations
8 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-8 of 8 references

Uehara—for providing a stimulating research environment

  • workshop—Brad Ballinger, Nadia Benbernou, +16 authors Ryuhei
  • Masterjun. SNES Super Mario World (USA) “glitched…
  • 2012
1 Excerpt

Demaine , Michael Hoffmann , and Markus Holzer . PushPush - k is PSPACE - Complete

  • Michal Forĭsek
  • Proceedings of the 3 rd International Conference…

Similar Papers

Loading similar papers…