Codex Computationally Resolves Open Q26 Queen-Domination Case: Minimum is 14
brain-out-of-order · reddit · 2026-08-07
A developer used ChatGPT/Codex to assist in calculations, achieving preliminary computational results for an open problem in combinatorics: the Q26 queen-domination problem. The problem asks for the minimum number of queens needed to dominate all squares of a 26x26 board.
Process and Conclusion:
- Using known structural constraints, the author categorized hypothetical 13-queen solutions into 156 canonical profiles.
- An exact SAT check was run for each profile, all returning unsatisfiable.
- Combined with the known 14-queen construction, this indicates the minimum number for a 26x26 board is 14.
Limitations: The author emphasizes that because complete search logs and a formal SAT proof certificate were not retained, this is currently a preliminary exhaustive computational result rather than an independently reproducible proof, requiring external verification.
More from Research
- Netflix details its production LLM judge: hundreds of thousands of recommendations scored weekly — omarsar0 · 2026-08-24
- Nature Comment: Provenance, not interpretability, grounds trust in autonomous science — gabepgomes · 2026-08-24
- New Architecture RHEA: Train 1B Model on 8GB VRAM — zemondza · 2026-08-24
- Trained two 16M-param models to do generative CAD with real physics — debreuil · 2026-08-24
- Claude model helps discover complex structure on S^6, solving 60-year-old math problem — Singularitarian · 2026-08-24
- Study: Agents read instructions/notes 60.5% of the time, rarely touch API docs — dair_ai · 2026-08-24