Opus 5.5 computer-assisted proof settles peaceable queens for n=16–20

_onionesque · x · 2026-11-21

jasondavies published a computer-assisted proof by Opus 5.5 showing that for the peaceable queens problem (OEIS A250000), a(16)–a(20) = 37, 42, 47, 52, 58 — each equal to ⌊7n²/48⌋ — proving Ainley's 1977 constructions optimal at these sizes. Previously known only for n ≤ 15. The repo includes the paper, exhaustive search code, and verification material.

Original post →

More from Research

Research channel →