TrackMania is NP-complete
classification
💻 cs.CC
keywords
np-completetrackmaniacheckedcompletingforevernationspolynomialprove
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.