2014/11/21 by Franck Dernoncourt, Dernoncourt, Franck · 1 voice
Computer Science · #Advanced Malware Detection Techniques #Artificial Intelligence in Games #Software Testing and Debugging Techniques #cs.CC
paper · pdf · doi:10.48550/arxiv.1411.5765
arxiv created 2014/11/21 · openalex publication_date 2014/11/21 · arxiv updated 2014/11/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.