LIPIcs - Leibniz International Proceedings in Informatics. 8th International Conference on Fun with Algorithms (FUN 2016)
Doi
Abstract
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
