No-three-in-line $D(57)$
The largest number of points of the $57 \times 57$ grid with no three on a line.
Value: $114$ Verified lower bound
Verified bounds
Verified bounds come with a certificate that is checked automatically: a formal proof in Lean, or an explicit construction checked by a program. Submit a certificate.
-
Lower bound:
$114$
Checked construction
no-three-in-line-57-lower-114, submitted by daniel-munro, 2026-11-05
[construction from T. Prellberg, No three in line configurations, OEIS A272651 (2026-02-20).] - Upper bound: None yet
Updates from the literature
-
Upper bound: $114$
Trivial or easy according to the secondary source.
[via No-three-in-line problem - Wikipedia] -
2025-11
Lower bound: $114$
T. Prellberg, personal communication, recorded on the no-three-in-line records page (2025-11).
[via The No-Three-in-Line Problem, Achim Flammenkamp, 2026-10-28]