Mario Kart Is Hard

DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015(2016)

引用 3|浏览11
暂无评分
摘要
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.
更多
查看译文
关键词
Time Trial, Satisfying Assignment, Traversal Time, Race Track, Variable Gadget
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要