Combinatorics·OpenAI Math·Result 187·Lean formalisation listed
Snaky in 21 Maker moves
One of the 372 results in OpenAI's public mathematics catalogue, filed under combinatorics: 1 preprint, the latest dated 25 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.
Latest paper
Snaky in 21 Maker moves
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Settles the Snaky achievement problem: Maker can force the six-cell Snaky shape within 21 of its own moves on the initially empty infinite square board. Maker moves first, each player claims one free cell per turn, and translations, rotations and reflections count as wins. (Lean)
Paper
Snaky in 21 Maker moves
We prove that Maker can achieve the Snaky hexomino within 21 actual Maker moves against arbitrary legal Breaker play on the initially empty infinite square board. The same bound holds on a 17×17 square; in fact, Maker can confine its claims to a fixed 251-cell board.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Related results in Combinatorics
- 188The sharp terminal leave in random triangle removalLean
- 189Cycle–clique Ramsey numbersLean
- 190Polynomial removal fails for ordered binary matricesLean
- 191A power improvement in the Heilbronn triangle lower boundLean
- 192Boolean functions violate the square-root degree bound by arbitrary factorsLean
- 155A counterexample to periodic tiling in dimension threeLean