A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Snaky
based on Result #187: Snaky in 21 Maker moves
>>> Check out Coolmath's new Guess the Hot Spot <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:counting, coloring Levels:1
Category:Combinatorics Lean version:YES! ✔
Rate this game! 4.5 out of 5 (8,889 votes)

>>> How to Play <<<
Snaky in 21 Maker moves. 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.

>>> Level Select <<<
released 2026-09-25  |  2 theorems · 2 lemmas · 10 proofs · 13,073 words  |  PLAY LEVEL 1 »  (pdf)
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\times17$ square; in fact, Maker can confine its claims to a fixed 251-cell board.

More Combinatorics Games!
A counterexample to periodic tiling in dimension three HOT!Borsuk's conjecture fails in dimension nine HOT!Counterexamples to the Hadwiger and Colin de Verdière conjecturesThe Euclidean plane cannot be colored with five colors PLAYABLE!
Erdős's reciprocal-sum conjecture and quasipolynomial Szemerédi boundsSuperexponential van der Waerden numbers HOT!Counterexamples to Sidorenko's conjecture and the forcing conjectureCounterexamples to Ryser's covering and Gyárfás's tree-cover conjectures

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games