Name
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, which we then extend to more complex tracks. 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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.tcs.2018.04.028 | Theoretical Computer Science |
Keywords | DocType | Volume |
Racetrack,State-graph,Complexity | Journal | 748 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael A. Bekos | 1 | 250 | 38.21 |
| Till Bruckdorfer | 2 | 33 | 5.50 |
| Henry Förster | 3 | 3 | 4.40 |
| Michael Kaufmann | 4 | 1224 | 107.33 |
| Simon Poschenrieder | 5 | 0 | 0.34 |
| Thomas Stüber | 6 | 0 | 0.34 |