Computational study demonstrates valid 2n point configurations on n × n grids up to n = 60, resolving all previously open cases in the no-three-in-line problem.
Using a constraint satisfaction formulation with rotational symmetry reduction, we exhibit configurations of 2 n points on the n × n grid for every 2 ≤ n ≤ 60 with no three collinear. These computations resolved every previously open case through n = 60 . We describe the formulation, computational search, and empirical scaling of the method.
No takes yet. Share an insight, caveat, or question.
Thomas Prellberg (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: