Mario Kart Is Hard

Author(s)
Waingarten, Erik; Bosboom, Jeffrey William; Demaine, Erik D; Hesterberg, Adam Classen; Lynch, Jayson R.
Thumbnail
DownloadMario kart is hard.pdf (1.565Mb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2016-11
URI
http://hdl.handle.net/1721.1/111596
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Department of Mathematics
Journal
Discrete and Computational Geometry and Graphs
Publisher
Springer International Publishing
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
Version: Author's final manuscript
ISBN
978-3-319-48531-7
978-3-319-48532-4
ISSN
0302-9743
1611-3349
Collections