The 82-queen cover of Q₁₆₃: minimality, and an obstruction at Q₁₆₇
Abstract
The queen's graph Qₙ has the squares of the n × n board as vertices, two squares adjacent when they share a row, a column or a diagonal, and γ(Qₙ) is its domination number. A recent preprint of Kong prints 82 squares of the 163 × 163 board and asserts, on the evidence of a short script, that they dominate it; with the Finozhenok–Weakley bound γ(Qₙ) ≥ ⌈ n/2⌉ this gives γ(Q₁₆₃)=82, an exact value beyond the published list, and the type A structure of the set improves the constant in Östergård–Weakley's amplification theorem to 17/33. We first re-establish every printed property of that certificate by exhaustive verified computation over all 163²=26 569 squares, in place of the script. We then prove two statements the source does not make. The certificate is a minimal dominating set: each of its 82 queens owns a square that no other queen of the set covers, so no 81 of them dominate. And — the main result — it does not extend: with the 82 squares kept in place, no dominating set of Q₁₆₇ of size at most 84 contains them, and none of Q₁₆₅ of size at most 83 does. The first is a nonexistence statement over all 27 889² ordered pairs of added squares, reduced to 499 × 27 889 by an anchor argument whose completeness is proved rather than assumed. Since γ(Q₁₆₇) ≥ 84 by Finozhenok–Weakley, a new exact value at 167 needs a new construction and not an extension of this one. Everything is machine-checked in Lean 4; the two published theorems we rely on — the Finozhenok–Weakley bound and Östergård–Weakley's amplification theorem — are cited rather than reproved, and the Finozhenok–Weakley bound appears as an explicit hypothesis of the statements that use it.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
3a267ae5c06731afa1ad8b59ef3d23094ffce3917250595ef4513c9b3697c3ab
Claim ledger
Stated results
qc163-00routine2026-08-28
Vacuity control: the board of Q₁63 really is 26,569 squares, and the covering relation is not trivially true
qc163-01known data2026-08-28
The certificate is 82 pairwise distinct squares of the 163 x 163 board
qc163-02known data2026-08-28
The x- and y-coordinate sets are exactly the odd integers of [-81, 81], each once (1-orthodoxy)
qc163-03known data2026-08-28
The 82 queens dominate Q₁63: 0 of the 26,569 squares are uncovered
qc163-04routine2026-08-28
Every one of the 82 queens has a private square, with an explicit witness table
qc163-05routine2026-08-28
Negative controls: one deletion leaves 212 squares uncovered, the same 82 queens leave 8 squares of Q₁65 uncovered, and a uniform 2-square shift leaves 49
qc163-06known data2026-08-28
The difference- and sum-diagonal multiset identities of the source, (eq:diff-multiset) and (eq:sum-multiset)
qc163-07known data2026-08-28
(e, f, u) = (16, 15, 24), both long diagonals occupied, and the type A condition holding with equality: e + f + 2u = 79 = (163-5)/2
qc163-08known data2026-08-28
The 1-cover property from the definition: all 6,561 even-even squares of Q₁63 share a diagonal with a queen
qc163-09routine2026-08-28
The two-inequality form of the covering condition: (aOdd, bOdd, aEven, bEven) = (17, 65, 66, 16) and both parity sums equal 82 against the threshold 80
qc163-10known data2026-08-28
gamma(Q₁63) <= 82, with gamma defined from scratch as the domination number of the queen's graph
qc163-11known2026-08-28
gamma(Q₁63) = 82, conditional on the Finozhenok-Weakley lower bound carried as an explicit hypothesis
qc163-12routine2026-08-28
No 81 of the 82 queens dominate Q₁63
qc163-13known data2026-08-28
The certificate is a 1-cover of Q₁63 in Ostergard-Weakley's sense, as a Prop
qc163-14known2026-08-28
The amplification coefficient the certificate supplies is 17/33, below 69/133 by 16/4389 and below 101/195 by 2/715, and still above 1/2
qc163-15routine2026-08-28
Q₁65: the certificate leaves 8 squares uncovered and no single added queen covers all 8
qc163-16candidate2026-08-28
Q₁67: no 84-queen dominating set contains the 82-queen certificate – the published cover does not extend within the Finozhenok-Weakley budget
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- The queen's graph Qₙ has the squares of the n × n chessboard as vertices, two squares adjacent when they share a row, a column, or a diagonal. Its domination number γ(Qₙ) is the least number of queens that occupy or attack every square. The lower bound
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7