SNAKY Problem #187
Free puzzle game · plays in your browser · made with Opus 5.5
SNAKY Problem #187 is a puzzle game that loads straight in the browser. Free to play, no install, no registration. If you came looking for Board Game, this is built in that mould. Opus 5.5 wrote the code; the prompt that produced it is on this page. It works on a phone as well as a desktop.
About SNAKY Problem #187
SNAKY is a turn-based logic puzzle on a square grid: the computer tries to build a six-cell shape called Snaky, and you block it, one cell per turn. It is built on OpenAI's published solution to problem #187 of its open mathematics release, a proof that the builder can always finish Snaky however the blocker plays, and your opponent is that proof itself, a 728-card winning strategy loaded unchanged. You cannot stop it forever, so the goal is to make it take as long as possible; a game ends when the shape is complete.
Click or tap a cell to block it; on a keyboard, arrow keys aim, Space blocks, R restarts and Esc opens the map. A dashed line traces any snake that is one cell from done, through the gap you must block, and two gaps at once means it wins on its next turn. Ten short levels come from the proof's own cards, each asking you to hold out a set number of moves, from three up to fifteen, for a star that unlocks the next. The final level is the full 17x17 proof and feeds the leaderboard, where 20 moves is a perfect defence. After each game the board shows every slip beside a block that would have held. Start with level 1: guide bubbles walk you through the first moves.
How was SNAKY Problem #187 made?
The prompt behind SNAKY Problem #187
"OpenAI just released a lot of mathematical problems and solutions... maybe we could try to find one interesting problem solution, and based on that create some kind of game of it... Is it possible to make an interesting game out of those discoveries? I mean choosing and taking one discovery, not all of them." Claude read the 373 result families in github.com/openai/math, shortlisted three a player could actually touch, and the creator picked #187, Snaky in 21 Maker moves ("let's make #187 now"). The paper ships its proof as a 728-card certificate; the game loads it byte for byte, checks it with the paper's own verifier assertions, and plays it as the opponent card by card. An exact solver, using the certificate's own count as its bound, measures the best possible defence every turn. It found that the proof's 21-move line walks past two finished Snakys, so against an opponent that takes free wins the best defence is 20. Ten certificate cards became the levels. Then a spotlight tutorial, a review of every slip, four test suites, and an independent reviewer agent whose seven bugs were fixed and pinned with tests. After the first play-test ("I don't understand what my goal is... to block the snake shape, or to allow him to build it?"), version 1.1 states the goal on screen, walks the first levels with one-line guide bubbles, and traces every snake that is one cell from done. Built in Claude Code with Claude Opus 5.5 at max effort.
Categories and tags
Questions about SNAKY Problem #187
6
- Is SNAKY Problem #187 free to play?
- Yes. SNAKY Problem #187 is free, runs in your browser, and needs no account. Nothing to download, no plugin, no sign-up — open the page and play.
- Do I need to download or install SNAKY Problem #187?
- No. SNAKY Problem #187 runs entirely in the browser on desktop and on a phone. There is nothing to install and no launcher to sign in to.
- Which AI model made SNAKY Problem #187?
- SNAKY Problem #187 was written by Opus 5.5, a model from Anthropic, using Claude Code. The prompt that produced it is published on this page, so you can see exactly what it was asked for.
- What is SNAKY Problem #187 like?
- It is a puzzle game, filed by its creator under Board Game and Polyomino. SNAKY is a turn-based logic puzzle on a square grid: the computer tries to build a six-cell shape called Snaky, and you block it, one cell per turn.
- Does SNAKY Problem #187 keep a high score?
- Yes. Any score SNAKY Problem #187 reports goes to the leaderboard under the game, and you do not need an account for it to count.
- How much did SNAKY Problem #187 cost to make?
- $36.91 in model usage, running Opus 5.5, over about 123 minutes of building. Every game here records what it cost, which is the point of the site.
Version 1.1 · updated 2026-10-27