| dc.contributor.author | Waingarten, Erik | |
| dc.contributor.author | Bosboom, Jeffrey William | |
| dc.contributor.author | Demaine, Erik D | |
| dc.contributor.author | Hesterberg, Adam Classen | |
| dc.contributor.author | Lynch, Jayson R. | |
| dc.date.accessioned | 2017-09-18T18:06:49Z | |
| dc.date.available | 2017-09-18T18:06:49Z | |
| dc.date.issued | 2016-11 | |
| dc.identifier.isbn | 978-3-319-48531-7 | |
| dc.identifier.isbn | 978-3-319-48532-4 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/111596 | |
| dc.description.abstract | Nintendo’s Mario Kart is perhaps the most popular racing video game franchise. Players race alone or against opponents to finish in the fastest time possible. Players can also use items to attack and defend from other racers. We prove two hardness results for generalized Mario Kart: deciding whether a driver can finish a course alone in some given time is NP-hard, and deciding whether a player can beat an opponent in a race is PSPACE-hard. | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Springer International Publishing | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/978-3-319-48532-4_5 | 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 | MIT Web Domain | en_US |
| dc.title | Mario Kart Is Hard | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Bosboom, Jeffrey, Erik D. Demaine, Adam Hesterberg, Jayson Lynch, and Erik Waingarten. “Mario Kart Is Hard.” Discrete and Computational Geometry and Graphs (2016): 49–59 © 2016 Springer International Publishing | 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.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Bosboom, Jeffrey William | |
| dc.contributor.mitauthor | Demaine, Erik D | |
| dc.contributor.mitauthor | Hesterberg, Adam Classen | |
| dc.contributor.mitauthor | Lynch, Jayson R. | |
| dc.relation.journal | Discrete and Computational Geometry and Graphs | 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 | Bosboom, Jeffrey; Demaine, Erik D.; Hesterberg, Adam; Lynch, Jayson; Waingarten, Erik | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-8526-4085 | |
| dc.identifier.orcid | https://orcid.org/0000-0003-3803-5703 | |
| dc.identifier.orcid | https://orcid.org/0000-0002-6053-1167 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
