Mario Kart Is Hard
Name
Mario kart is hard.pdf
Size
1.57 MB
Format
Adobe PDF
Checksum (MD5)
30586d2fa291c43d32c43f58e91ea881
Author(s)
Waingarten, Erik
Bosboom, Jeffrey William
Demaine, Erik D
Hesterberg, Adam Classen
Lynch, Jayson R.
Date Issued
November 2016
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
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.
MIT 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
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-48532-4_5
