PulseAugur
EN
LIVE 20:29:33

OpenAI's Codex may have solved the 26x26 queen domination problem

A user on Reddit claims that OpenAI's Codex model may have computationally resolved the open Q26 queen-domination case. The user detailed a method involving SAT checks on canonical profiles derived from known structural constraints, finding no valid placement for 13 queens on a 26x26 board. This suggests the minimum number of queens required is 14, a finding that awaits independent reproduction due to the lack of retained implementation details and formal proof certificates. AI

IMPACT This demonstrates the potential for AI models to assist in solving complex mathematical and combinatorial problems.

RANK_REASON The item describes a computational result related to a mathematical problem, using an AI model (Codex) as a tool for the computation. [lever_c_demoted from research: ic=1 ai=0.7]

Read on r/OpenAI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

OpenAI's Codex may have solved the 26x26 queen domination problem

COVERAGE [1]

  1. r/OpenAI TIER_2 English(EN) · /u/brain-out-of-order ·

    Codex may have computationally resolved the open Q26 queen-domination case. Seeking independent reproduction

    <!-- SC_OFF --><div class="md"><p>A queen dominates its own square and every square sharing its row, column, or diagonal. The question is whether 13 queens can dominate all 676 squares of a 26 by 26 board.</p> <p>Using known structural constraints, every hypothetical 13-queen sol…