← All problems

The square achievement game on n × n boards

For each integer n≥1n\ge 1, consider the game on the cell set {1,…,n}2\{1,\ldots,n\}^2. Two players alternately claim previously unclaimed cells. A player wins upon claiming all four cells {(i,j),(i+d,j),(i,j+d),(i+d,j+d)}\{(i,j),(i+d,j),(i,j+d),(i+d,j+d)\} for some integers 1≤i≤n−d1\le i\le n-d, 1≤j≤n−d1\le j\le n-d, and 1≤d≤n−11\le d\le n-1; if the board is filled without either player doing so, the game is a draw. Determine the exact set of nn 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 n≥5n\ge 5.

References

Progress summary

Refreshed
Open · solution reported

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 n=5n=5 and supplies one strategy for all larger boards.

Known results

  • Bacher and Eliahou, 1990s: every 15×1515 \times 15 binary matrix contains an axis-parallel square with equal entries, so a winner must occur at n=15n=15.
  • Erickson, 2011: computer-supported constructions claim second-player prevention for n=3,4n=3,4 and a first-player win for n=5n=5.
  • Erickson's computational evidence includes square-free end-configurations for 3≤n≤113 \le n \le 11 and a parametric family at n=14n=14, relevant to drawn games.

October 2026 preprint claim

Sean Reid's arXiv preprint claims that the first player wins if and only if n≥5n \ge 5, with a common strategy for n≥6n \ge 6, 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 n=5n=5 and the uniform strategy for n≥6n \ge 6 are claimed in a preprint but remain unverified; earlier computational results establish only partial cases.

Sources

Solutions 0

No solutions have been posted yet.