License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2016.6
URN: urn:nbn:de:0030-drops-58818
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5881/
Go to the corresponding LIPIcs Volume Portal


Bekos, Michael A. ; Bruckdorfer, Till ; Förster, Henry ; Kaufmann, Michael ; Poschenrieder, Simon ; Stüber, Thomas

Algorithms and Insights for RaceTrack

pdf-format:
21.pdf (0.8 MB)


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.

BibTeX - Entry

@InProceedings{bekos_et_al:LIPIcs:2016:5881,
  author =	{Michael A. Bekos and Till Bruckdorfer and Henry F{\"o}rster and Michael Kaufmann and Simon Poschenrieder and Thomas St{\"u}ber},
  title =	{{Algorithms and Insights for RaceTrack}},
  booktitle =	{8th International Conference on Fun with Algorithms (FUN 2016)},
  pages =	{6:1--6:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-005-7},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{49},
  editor =	{Erik D. Demaine and Fabrizio Grandoni},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5881},
  URN =		{urn:nbn:de:0030-drops-58818},
  doi =		{10.4230/LIPIcs.FUN.2016.6},
  annote =	{Keywords: Racetrack, State-graph, complexity}
}

Keywords: Racetrack, State-graph, complexity
Seminar: 8th International Conference on Fun with Algorithms (FUN 2016)
Issue Date: 2016
Date of publication: 25.05.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI