SOURCE CONTEXT / FAMILY 187 · OPENAI MATH
Snaky on 251 cells:
a strategy within 21 claims.
We checked the strategy certificate and formalized its finite-board guarantee in Lean: from an empty board, Maker can claim a six-square Snaky within 21 claims against every legal Breaker reply under the formal rules.
The viewer shows one independently checked play that wins after eight Maker claims on the exact 251-cell board. It illustrates the guarantee; it does not establish an eight-claim bound against every reply. The paper already states the finite-board result.
01 / One complete branch
Replay the eight-claim example.
Coordinates label individual squares. Numbers inside occupied squares give the round they were claimed. Each displayed state is after the selected round, or immediately after the winning Maker claim. On a narrow screen, scroll the board sideways; keyboard users can focus it and use the arrow keys.
Read the complete move list without the diagram
02 / The local reason
Why a legal Breaker reply leaves a continuation.
Start from a certificate card
A card lists cells Maker must already own, an envelope free of Breaker cells, and a bound on the additional Maker claims needed.
Make a fresh claim
Maker claims the card's pivot. If Maker already owns it, a fresh replacement still costs one move. The finite-board argument ensures such a square is available.
Keep a surviving continuation
Every cell shared by all child envelopes is already owned by Maker. Breaker must claim a fresh cell, so its reply cannot spoil every child. Maker follows one that remains available.
The chosen child may have a much smaller bound. That does not mean Maker played several moves at once. The viewer keeps actual claims, the 21-claim allowance, and each card's remaining bound separate.
03 / Follow the exact evidence
Certificate checks, the Lean theorem and the play record
The browser displays saved states; it does not run Lean. A separate checker replays this particular execution. The Lean theorem establishes the strategy guarantee under its formal game rules. The displayed execution is not a formally verified extraction of that strategy.
The paper already supplies the finite-board result. This project checks the certificate and formalizes the finite-board guarantee. The example does not establish a better move bound, optimality, or improved AI reasoning.