Reports new heuristic lower bounds for snake-in-the-box problem, indicating improved performance in hypercubes.
This paper presents new heuristic lower bounds for the snake-in-the-box problem in high-dimensional hypercubes (Q_14, Q_15, Q_16, Q_17). Using a pruned breadth-first search described by Ace, we obtain snakes of length 5750, 11249, 21411, and 40835 in dimensions 14, 15, 16, and 17, surpassing the previous lower bounds of 4932, 9866, 19738, and 39478 by Abbott-Katchalski.
No takes yet. Share an insight, caveat, or question.
Kristijonas Bernatonis (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: