RPGJS Studio
Choose a playable world, customize maps and events visually, then press Play. Start free in your browser and export your RPGJS source.
Browse all 728 cards of the 21-move Snaky certificate: required cells, pivot and envelope of each card beside its child conditions, with a Breaker-reply simulator.
GamesHTML · PythonGitHub @ian52nAvailability needs another checkOwner unconfirmed
Have you tried it? One tap is enough. No sign-in needed.
No updates detected yet. GitHub releases will appear here.
Owners of public repositories under a personal GitHub account can sign in to verify ownership and manage the introduction themselves. No administrator approval is needed.
Sign in, generate a verification file, and commit it to this repository’s default branch within 30 minutes. Files on other branches or forks do not count. Then check the file below to manage the project without administrator approval. Keep the file to retain your access.
If needed, you will go to sign-in. After signing in, return here and press your chosen verification button again.
Run /nomorevibe verify in your project folder to verify ownership and manage the introduction yourself.
Verify in one minuteAsk about other verification options
Interactive viewer for the 728 cards of the 21-move Snaky certificate, with a Breaker-reply simulator.
Loading the full README.
Read the full README ↗An interactive viewer for the 728 cards of the 21-move Snaky certificate from “Snaky in 21 Maker moves” (OpenAI, 2026), Appendix D. The live page is linked in this repository's About panel.
Each card is drawn on square cells: X marks a required cell, gray is the pivot, and white is the rest of the envelope. The card's child conditions are drawn in the same coordinates. Hover a cell to place a Breaker reply and see which children survive; click a child to follow it down the proof.
Link to a specific card with #c<number>, for example #c727.
On every load the page recomputes all 728 cards from the combination rule (Lemma 3, equation (2)), checks that each of the 37,042 Breaker reply classes leaves a child alive, and compares the certificate's SHA-256 with the value printed in the paper.
index.html is generated. Edit template.html or engine.js, then run:
python3 build.py # writes index.html
python3 build.py --artifact # writes the variant used as a Claude artifact
build.py stops if certificate.txt differs from the paper's file.
In a clone of https://github.com/openai/math, from the folder
preprints/Snaky-in-21-Maker-moves-September-25-2026:
python3 verification/supporting/route21/primary.py --output reference.json
Then, in this repository:
node test_engine.js certificate.txt path/to/reference.json
This compares all 728 cards and all 1,620 combination nodes, inline ones included, and checks the counts in Section 6 of the paper.
| File | Contents |
|---|---|
index.html | The page that GitHub Pages serves (generated) |
template.html | Layout, styles and interaction |
engine.js | Certificate parser and combination rule; runs in the browser and in Node |
certificate.txt | Appendix D, byte-identical to the paper's verification/certificate.txt |
build.py | Inlines the engine, certificate and license text into index.html |
test_engine.js | Cross-check against the paper's reconstruction |
This project is licensed under the Apache License 2.0; see LICENSE.
certificate.txt is the certificate from “Snaky in 21 Maker moves” (OpenAI,
2026), copied unchanged from
https://github.com/openai/math/tree/main/preprints/Snaky-in-21-Maker-moves-September-25-2026,
where it is distributed under the Apache License 2.0. See NOTICE.
This project is independent and is not affiliated with or endorsed by OpenAI.
To cite the paper, its repository gives:
@misc{OAI:Snaky-in-21-Maker-moves-September-25-2026,
author = {{OpenAI}},
title = {{Snaky in 21 Maker moves}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/Snaky-in-21-Maker-moves-September-25-2026/article.pdf}{OAI:Snaky-in-21-Maker-moves-September-25-2026}},
year = {2026}
}