Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.
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.
Linked by 1 identifiable commenter in 1 comment across 1 thread, from May 2016 to May 2016. Found in 1 HN submission from May 2016 to May 2016. Open submission discussions.
https://arxiv.org/abs/1411.5765
cheapsteakView on HNParent context