TL;DR
This paper proves that the problem of completing an untimed, unbounded track in TrackMania Nations Forever is NP-complete, indicating its computational difficulty through a reduction from 3-SAT.
Contribution
It establishes the NP-completeness of TrackMania track completion, a novel complexity result for a popular racing game.
Findings
Track completion problem is NP-complete
Reduction from 3-SAT used to prove complexity
Solution verification is polynomial-time
Abstract
We prove that completing an untimed, unbounded track in TrackMania Nations Forever is NP-complete by using a reduction from 3-SAT and showing that a solution can be checked in polynomial time.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSoftware Testing and Debugging Techniques · Artificial Intelligence in Games · Advanced Malware Detection Techniques