| dc.contributor.author | Aloupis, Greg | |
| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Guo, Alan Xinyu | |
| dc.contributor.author | Viglietta, Giovanni | |
| dc.date.accessioned | 2019-06-18T19:04:13Z | |
| dc.date.available | 2019-06-18T19:04:13Z | |
| dc.date.issued | 2015-06 | |
| dc.identifier.issn | 0304-3975 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/121347 | |
| dc.description.abstract | 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. Keywords:
Nintendo games; Video games; Computational complexity; NP-hardness; PSPACE-hardness | en_US |
| dc.language.iso | en | |
| dc.publisher | Elsevier BV | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.tcs.2015.02.037 | en_US |
| dc.rights | Creative Commons Attribution-NonCommercial-NoDerivs License | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Classic Nintendo games are (computationally) hard | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Aloupis, Greg et al. "Classic Nintendo games are (computationally) hard." Theoretical Computer Science 586 (June 2015): 135-160 © 2015 Elsevier B.V. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.relation.journal | Theoretical Computer Science | en_US |
| dc.eprint.version | Original manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2019-06-18T12:28:41Z | |
| dspace.date.submission | 2019-06-18T12:28:42Z | |
| mit.journal.volume | 586 | en_US |
