Constraint Satisfaction Programming for the No-three-in-line Problem
Abstract
Using a constraint satisfaction approach, we exhibit configurations of $2n$ points on the $n\times n$ grid for all $n\le60$ with no three collinear. Consequently, the smallest $n$ for which it is unknown whether $D(n)=2n$ increases from $47$ to $61$.
Fields of Study & Subjects
Constraint Satisfaction and Optimization
Advanced Combinatorial Mathematics
Advanced Graph Theory Research
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 8 February 2026
- Language
- EN
- Document type
- Preprint