2026-07-28T08:11:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5881 2024-03-06T10:37:05Z ddc:004 open_access

Algorithms and Insights for RaceTrack Bekos, Michael A. Bruckdorfer, Till Förster, Henry Kaufmann, Michael Poschenrieder, Simon Stüber, Thomas Racetrack State-graph complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael A. Bekos and Till Bruckdorfer and Henry Förster and Michael Kaufmann and Simon Poschenrieder and Thomas Stüber 2016 Is Part Of LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FUN.2016.6 urn:nbn:de:0030-drops-58818 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.6 eng https://creativecommons.org/licenses/by/3.0/legalcode