Snaky in 21 Maker moves
In the weak Maker-Breaker achievement game for Snaky on the initially empty infinite square board , there is one globally legal Maker policy that completes an allowed copy of within at most 21 actual Maker claims against every legal continuation of Breaker.
The game-theoretic soundness of the combination rule (Lemma 3), the base cases (Lemma 4), the finite certificate calculation (Proposition 5), and the deterministic policy extraction (Section 4) are all completely proved and supported by the full certificate in Appendix D and verifier in Appendix G.
“Theorem 1. In this game, there is one globally legal Maker policy that completes an allowed copy of S within at most 21 actual Maker claims against every legal continuation of Breaker. Equivalently, extend the policy by fresh claims after an earlier win: its Maker set after claim 21 contains a target whenever the first 20 Breaker replies are legal.” · Show in paper