By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

Latest version

Checks complete

Sync OpenAI Math manuscripts from 4eaee87548250b2682affda7d05d947c05554bae

Committed

All papers

Claims

Findings

Snaky in 21 Maker moves

In the weak Maker-Breaker achievement game for Snaky S={(0,0),(1,0),(2,0),(3,0),(3,1),(4,1)}S = \{(0,0),(1,0),(2,0),(3,0),(3,1),(4,1)\} on the initially empty infinite square board Z2\mathbb{Z}^2, there is one globally legal Maker policy that completes an allowed copy of SS within at most 21 actual Maker claims against every legal continuation of Breaker.

Let (Ai,Ti,hi)(A_i, T_i, h_i), 1≤i≤r1 \le i \le r, be valid claims with 1≤r<∞1 \le r < \infty, and let p∈Z2p \in \mathbb{Z}^2. Defining T={p}∪⋃i=1rTiT = \{p\} \cup \bigcup_{i=1}^r T_i, A=(⋃i=1rAi∪⋂i=1rTi)∖{p}A = (\bigcup_{i=1}^r A_i \cup \bigcap_{i=1}^r T_i) \setminus \{p\}, and h=1+max⁡ihih = 1 + \max_i h_i, the triple (A,T,h)(A, T, h) is valid. Furthermore, at a position with Breaker to move, if A∪{p}⊆MA \cup \{p\} \subseteq M and B∩T=∅B \cap T = \emptyset, then Maker has already won or can win within h−1h-1 further Maker moves.

The data in Appendix D have exactly 722 numbered lines with indices 6,…,7276, \dots, 727, each with a nonempty child list, allowed placements of earlier cards, and finite nonempty parenthesized combinations. Together with the six bases, they produce 728 valid claims of height at most 21, with the last card having p727=(8,8)p_{727} = (8,8), A727=∅A_{727} = \emptyset, ∣T727∣=251|T_{727}| = 251, h727=21h_{727} = 21, and T727⊆{0,…,16}2T_{727} \subseteq \{0, \dots, 16\}^2.

Maker wins the weak Maker-Breaker game for Snaky within 21 actual Maker claims on the initially empty 251-cell board T727T_{727}, and also on the initially empty 17×1717 \times 17 board {0,…,16}2\{0, \dots, 16\}^2.

At an arbitrary finite position with Maker to move, if Maker owns {(0,0),(1,0),(2,0),(3,0)}\{(0,0),(1,0),(2,0),(3,0)\} and Breaker owns at most three cells in Q=([−3,6]×[−4,4])∩Z2Q = ([-3,6] \times [-4,4]) \cap \mathbb{Z}^2, then Maker has already won or can force a win, even with additional Maker cells and arbitrary Breaker cells outside QQ.

There is one ordinary Maker policy on the infinite square board that, from the empty position, completes a copy of SS within 25 actual fresh Maker claims against every legal Breaker continuation.

There is one ordinary Maker policy on the initially empty infinite square board that completes an allowed copy of SS within 35 actual Maker claims against every legal Breaker play.

Methods

Conditional winning positions (A,T,h)(A, T, h) are combined using a finite combination rule (Lemma 3) that tracks arbitrary prior Maker and Breaker ownership and counts actual future Maker moves, including replacement moves.

Source excerpts

“Lemma 3 (Combination rule). Let (Ai , Ti , hi), 1 <= i <= r, be valid claims, where 1 <= r < inf, and let p in Z^2. Define T = {p} U Ui=1U_{i=1}^r T_i, A = (Ui=1U_{i=1}^r A_i U \cap_{i=1}^r T_i) \ {p}, h = 1 + max_i h_i.” · Show in paper

The 21-move certificate encodes 722 composite cards using a 17-character coordinate alphabet, 8 bit-coded signed permutations, backward card references, and inline parenthesized combination expressions.

Source excerpts

“The coordinate alphabet is 0123456789ABCDEFG. A two-character word XY denotes the point (x, y) whose coordinates are the positions of X and Y in this alphabet, counting from zero.” · Show in paper

“Every data line consists of its decimal card number j, a pivot coordinate, and a nonempty ordered list of children. Each child is either a reference or an expression of the form (XY child child ...).” · Show in paper

The 25-move construction uses a reduced-envelope representation (P,E,h)(P, E, h) that omits required Maker cells from the Breaker-free region and aligns child cards via lexicographically ordered required-cell anchors.

Source excerpts

“The normalization (P, E, h) |-> (A, T, h) = (P, P U E, h) preserves exactly the admissible positions.” · Show in paper

“For a reference to card j, order its required set Pj lexicographically, by the first coordinate and then the second, starting with index zero. Write a placement code r uniquely as r = 8k + d, 0 <= d < 8, and let aj,k be the kth cell in that order.” · Show in paper

The 35-move construction uses a letter-and-offset encoding kLuv where k is an earlier card index, L is one of eight orientation letters, and u, v are offset-by-four translation digits.

Source excerpts

“A term kLuv contains an earlier decimal row index k < i, one letter L, and two individual decimal digits u, v. Its placement is FLuv(x, y) = RL(x, y) + (u - 4, v - 4)” · Show in paper

Standalone Python programs independently parse each literal certificate, verify SHA-256 checksums, reconstruct all finite sets and heights, and check all local reply classes.

Source excerpts

“Each primary program parses its literal data, checks the grammar and backward references, applies the specified placements, and reconstructs every required set, envelope, and height. A separate implementation for each dialect independently parses and reconstructs the same data.” · Show in paper