No-three-in-line $D(51)$

102 points of the 51 by 51 grid with no three on a line

The largest number of points of the $51 \times 51$ grid with no three on a line.

Value: $102$ 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: $102$ Checked construction
no-three-in-line-51-lower-102, 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: $102$
Trivial or easy according to the secondary source.
[via No-three-in-line problem - Wikipedia]
2025-10-28 Lower bound: $102$
T. Prellberg, personal communication, recorded on the no-three-in-line records page (2025-10-28).
[via The No-Three-in-Line Problem, Achim Flammenkamp, 2026-10-28]