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 Pokmon. Our results apply to generalized versions of Super Mario Bros.?13, The Lost Levels, and Super Mario World; Donkey Kong Country 13; all Legend of Zelda games; all Metroid games; and all Pokmon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend of Zelda games.
nintendo games np-hardness video games computational complexity pspace-hardness