Constraint satisfaction programming for the no-three-in-line problem
Abstract
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.
Fields of Study & Subjects
Constraint Satisfaction and Optimization
Advanced Combinatorial Mathematics
Advanced Graph Theory Research
Publication details
- Journal / source
- Journal of Combinatorial Theory Series A
- Volume
- 225
- Pages
- 106244–106244
- Publication date
- 14 August 2026
- Language
- EN