A Census of New Snake-in-the-Box Records

The snake-in-the-box problem, introduced by Kautz in 1958, asks for the longest induced (chordless) path, called a snake, in the hypercube graph $Q_n$.

The maximum length $a(n)$ is known in each dimension $n \leq 8$.

We give snakes that are longer than the previous best-known in every dimension from $9$ to $13$, improving the lower bound on $a(n)$.

All record-length paths are provided in a computer-verifiable dataset.