3 papers
math.CO2026
No-three-in-line sets on the checkerboard grid
Thomas Prellberg
The classical no-three-in-line problem asks for the largest number (D(n)) of points that can be chosen from an (n \times n) grid with no three collinear. We study the checkerboard-…
math.CO2026
Constraint Satisfaction Programming for the No-three-in-line Problem
Thomas Prellberg
Using a constraint satisfaction approach, we exhibit configurations of points on the grid for all with no three collinear. Consequently, the smallest …
cs.AI2025
Three methods, one problem: Classical and AI approaches to no-three-in-line
Pranav Ramanathan, Thomas Prellberg, Matthew Lewis +4
The No-Three-In-Line problem asks for the maximum number of points that can be placed on an n by n grid with no three collinear, representing a famous problem in combinatorial geom…