| dc.contributor.author | Aloupis, Greg | |
| dc.contributor.author | Demaine, Erik D. | |
| dc.contributor.author | Guo, Alan | |
| dc.contributor.author | Viglietta, Giovanni | |
| dc.date.accessioned | 2015-11-23T15:35:10Z | |
| dc.date.available | 2015-11-23T15:35:10Z | |
| dc.date.issued | 2014 | |
| dc.identifier.isbn | 978-3-319-07889-2 | |
| dc.identifier.isbn | 978-3-319-07890-8 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/99991 | |
| 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 Pokemon. Our results apply to generalized versions of Super Mario Bros. 1, 3, 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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-0829672) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-1065125) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-6922462) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Wiley Blackwell | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-319-07890-8_4 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/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, Erik D. Demaine, Alan Guo, and Giovanni Viglietta. “Classic Nintendo Games Are (Computationally) Hard.” Fun with Algorithms (2014): 40–51. | 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.contributor.mitauthor | Demaine, Erik D. | en_US |
| dc.contributor.mitauthor | Guo, Alan | en_US |
| dc.relation.journal | Fun with Algorithms | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Aloupis, Greg; Demaine, Erik D.; Guo, Alan; Viglietta, Giovanni | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
