Skip to content
All apps

Snaky in 21 moves

About this app

You block, the AI builds from a proof certificate: after at most 21 Maker moves the six-cell shape Snaky stands. Counter, zone, threats, second mode as Maker; openai/math family 187.

The game

Two players take turns placing one stone each on infinite squared paper, with Maker going first. Maker wins as soon as they own a given shape, rotations and reflections allowed; Breaker only wants to prevent that. For small shapes the winner has been known since the 1970s. Breaker’s main weapon is the pairing strategy, which works for every shape with seven or more cells. Among the 35 hexominoes only Snaky was unresolved, and Snaky provably has no pairing strategy. An AI-generated preprint in github.com/openai/math (family 187) claims a Maker strategy that forces Snaky within at most 21 Maker moves. The catalogue lists this as formalised in Lean; the preprint is not peer-reviewed.

What the app shows

The Maker AI does not compute live; it reads a proof tree of 722 cards that is embedded in the app unchanged. Each card says: if Maker has these stones and the zone is free of Breaker, Maker wins within h moves. For every Breaker move there is a sub-card whose zone that move missed. You can show the zone, the threats and the next move; a counter shows Maker’s moves and the guarantee, which starts at 21 and can only go down. A panel places other small shapes in context.

Try it yourself

Block as stubbornly as you can as Breaker and see whether you get past 21 Maker moves. Let the stubborn computer Breaker play a whole game: it gets the most out of the position, and 21 is reached. Swap roles and build yourself; with the certificate hint the guarantee holds, and once you leave it you play without one. That the strategy holds against all infinitely many ways of playing is shown only by the proof, and whether it can be done faster remains open.

Frequently asked questions

What is a Maker-Breaker game?
In a Maker-Breaker game two players take turns placing stones. Maker wants to fully occupy a certain structure, such as a shape made of cells; Breaker only wants to stop that and wins if they manage it forever. Unlike tic-tac-toe, Breaker does not have to build anything.
What is Snaky?
Snaky is a shape made of six cells (a hexomino) that looks like a small snake. In the study of which polyominoes Maker can force on the infinite board, it was the only unresolved hexomino. Snaky provably has no pairing strategy for Breaker.
Can Maker force Snaky on the infinite board?
An AI-generated preprint in the catalogue github.com/openai/math (family 187) claims a strategy with which Maker owns Snaky after at most 21 of their own moves against any Breaker play, and the same on a 17×17 board. The catalogue lists the strategy for the infinite board as formalised in Lean. The preprint has not yet been peer-reviewed, and whether 21 is optimal remains open.
What can I try out in this app?
You play against the Maker AI and try to stop Snaky, or build it yourself against a stubborn, greedy or random computer Breaker. Zone, threats and the next move can be shown. A counter shows how many Maker moves the guarantee still allows.

Subject: Open problems, solved by AI

More from Open problems, solved by AI

A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps