Fast First-Move Queries through Run-Length Encoding

Proceedings of the International Symposium on Combinatorial Search, 7

Volume

Vol. 7 No. 1 (2014): Seventh Annual Symposium on Combinatorial Search

Full Papers

We introduce a novel preprocessing-based algorithm to solve the problem of determining the first arc of a shortest path in sparse graphs. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows and columns in a first-move matrix and then performs run length encoding (RLE) on the contents of the matrix.

10.1609/socs.v5i1.18311