New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction
Read the original on arXiv AI →The paper reports a new record for the snake-in-the-box problem, presenting a length‑191 snake in the 9‑dimensional hypercube, surpassing the previous 190‑length record that had stood for 14 years. It also establishes new lower bounds for dimensions 10 through 13. The authors introduce a novel search technique called snakepits, which expands the search space by considering collections of disjoint snakes, and propose a new benchmark, Snakepit‑in‑the‑Box, that evaluates maximal edge counts across multiple components. Additionally, they present Beam Anchor, a learned construction algorithm that generates 100 inequivalent length‑190 snakes in dimension 9.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.