Constraint Satisfaction Programming for the No-three-in-line Problem

Thomas Prellberg

Using a constraint satisfaction approach, we exhibit configurations of $2n$ points on the $n\times n$ grid for all $n\le 60$ with no three collinear. Consequently, the smallest $n$…