Classic Nintendo Games Are (Computationally) Hard


The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract We prove NP-hardness results for five of Nintendo's largest video game franchises: Mario, 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.

DOI: 10.1007/978-3-319-07890-8_4

Extracted Key Phrases

35 Figures and Tables

Showing 1-10 of 10 references

USA) " glitched " in 02:36

  • Masterjun, Mario Snes Super, World
  • 2012 Legend of Zelda (Game) Legend of Zelda: A Link to the Past