Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
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.
arXiv comments
36 pages, 36 figures. Fixed some typos. Added NP-hardness results (with proofs and figures) for American SMB2 and Zelda 2
Linked by 3 identifiable commenters in 3 comments across 3 threads, from Sep 2017 to Aug 2019. Found in 9 HN submissions from Mar 2012 to Sep 2017. Open submission discussions.
I wrote a paper on this a number of years ago. Here were my primary sources: https://arxiv.org/abs/cs/0007021 https://arxiv.org/abs/1203.1895 I believe the second depends on the first.
I wrote a paper on this a number of years ago. Here were my primary sources: https://arxiv.org/abs/cs/0007021 https://arxiv.org/abs/1203.1895 I believe the second depends on the first.
stoopsView on HNParent context