Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.07751 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908819931529216 |
|---|---|
| author | Prellberg, Thomas |
| author_facet | Prellberg, Thomas |
| contents | 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$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_07751 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Constraint Satisfaction Programming for the No-three-in-line Problem Prellberg, Thomas Combinatorics 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$. |
| title | Constraint Satisfaction Programming for the No-three-in-line Problem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2602.07751 |