New Snake-in-the-Box Records via Snakepit Surgery and Learned Construction.

arXiv:2607.15270v3 Announce Type: cross Abstract: The snake-in-the-box problem asks for a longest induced path in the hypercube graph $Q_n$. We find a length-191 snake in dimension $n=9$, the lowest dimension where the maximum is unknown, improving the previou