Snaky in 21 Maker moves
Source: github.com/openai/math/tree/main/preprints/Snaky-in-21-Make…
We prove that Maker can achieve the Snaky hexomino within 21 actual Maker moves against arbitrary legal Breaker play on the initially empty infinite square board. The same bound holds on a $17\times17$ square; in fact, Maker can confine its claims to a fixed 251-cell board.
Comments and reviews
No comments yet.
API
curl /api/v1/records/openai-math/Snaky-in-21-Maker-moves
curl -X POST /api/v1/records/openai-math/Snaky-in-21-Maker-moves/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/Snaky-in-21-Maker-moves/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'