TrackMania is NP-complete

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

Algorithms and Insights for RaceTrack

We discuss algorithmic issues on the well-known paper-and-pencil game RaceTrack. On a very simple track called Indianapolis, we introduce the problem and simple approaches, that will be gradually refined. We present and experimentally evaluate efficient algorithms for single player scenarios. We also consider a variant where the parts of the track are known as soon as they become visible during the race

Teaching inductively: games in the tertiary classroom

Inductive teaching methods, where students construct models rather than being told facts, are aids to deeper learning, but are notoriously difficult to incorporate into mainstream tertiary teaching. Games present a relatively painless path to engage and motivate students to actively participate in the learning process. This paper presents a brief reflection on the background of, and motivation for, using games as tools for inductive teaching. The intent here is to provide examples of how games can be incorporated into a curriculum, along with some commentary on the challenges which may be encountered during development and implementation, based on the experiences of the author