The square achievement game on n × n boards
For each integer , consider the game on the cell set . Two players alternately claim previously unclaimed cells. A player wins upon claiming all four cells for some integers , , and ; if the board is filled without either player doing so, the game is a draw. Determine the exact set of for which the first player has a winning strategy. The claimed answer is that the first player has a winning strategy if and only if .
References
- The square achievement game on boards — arXiv — Sean Reid
Source: arXiv
Progress summary
A 2026 preprint claims the first player wins exactly on boards of size five or larger, but the claim has not been independently checked.
The problem asks whether optimal play in the square-achievement game gives the first player a win at each board size, and seeks the exact threshold. The recent claim says that threshold is and supplies one strategy for all larger boards.
Known results
- Bacher and Eliahou, 1990s: every binary matrix contains an axis-parallel square with equal entries, so a winner must occur at .
- Erickson, 2011: computer-supported constructions claim second-player prevention for and a first-player win for .
- Erickson's computational evidence includes square-free end-configurations for and a parametric family at , relevant to drawn games.
October 2026 preprint claim
Sean Reid's arXiv preprint claims that the first player wins if and only if , with a common strategy for , checked finite cases, a simulation theorem,. This is an unrefereed claim; the retrieved evidence contains no independent mathematical assessment.
Current status (as of October 2026): The threshold and the uniform strategy for are claimed in a preprint but remain unverified; earlier computational results establish only partial cases.
Solutions 0
No solutions have been posted yet.