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.
More from Research
- AI-generated text is getting harder to read: density over communication — abenitezburraco · 2026-11-21
- Hassabis predicted 2 years for AI to crack a Millennium Prize problem; 6 months later, both Riemann and Navier–Stokes have proposed solutions — Hesamation · 2026-11-21
- GPT-2 'sleep' replay from a frozen snapshot keeps 58% of old facts vs 6% without — Junior_Reputation639 · 2026-11-21
- ERC reviewer rejects LLM autoformalization proposal: "tried without good results" — marc_lelarge · 2026-11-21
- Terence Tao on AI math: 'strip mining' that wins proofs but teaches us nothing — yacineMTB · 2026-11-21
- Anthropic claims Claude proved the Riemann hypothesis; Stanford posts all-human rival proof hours later — The Decoder · 2026-11-21