math.CO — Combinatorics
Peaceable queens on boards of size 16 to 20
Let be the largest such that white and black queens can be placed on an board with no queen attacking a queen of the other colour (OEIS A250000). The refereed literature and the OEIS gave for , and in 2026 Arevalo determined , and in an unrefereed, AI-assisted computational note. We prove and , which were open, and we confirm , and independently, with two separately written programs. In each case , so the constructions that Ainley gave in 1977 are optimal on these boards. The proof is computer-assisted. As in earlier work, we label each of the lines of the board white or black, which turns the problem into maximising the smaller of two cell counts. Our new ingredient is the bound: for fixed rows and columns we bound that quantity by Lagrangian duality, and each Lagrangian subproblem is a minimum cut on the diagonals. With symmetry breaking, the search for meets row/column labellings up to symmetry, and a single family of minimum cuts prunes every one of them. That search took 221.9 CPU hours, mostly on cloud machines. A second implementation repeats the whole search for every . Orbit counts by Burnside's lemma confirm that every search is complete, and exact LP certificates and SAT proofs checked by drat-trim give further checks. As side results we find 26 and 5 inequivalent optimal configurations for and (OEIS A260680), and we confirm by computation that the and tori admit 51 and 64 queens of each colour but not more (A279405), values that also follow from Harries's exact formula for even tori.