\pdfoutput=1 \documentclass[11pt]{article} \usepackage[T1]{fontenc} \usepackage{lmodern} \usepackage{amsmath,amssymb,amsthm,mathtools} \usepackage{booktabs,array} \input{claims} \usepackage[margin=1in]{geometry} \usepackage[colorlinks=true,urlcolor=blue,citecolor=blue,linkcolor=blue]{hyperref} \newtheorem{theorem}{Theorem}[section] \newtheorem{proposition}[theorem]{Proposition} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \theoremstyle{remark} \newtheorem{remark}[theorem]{Remark} \emergencystretch=3em \newcommand{\W}{\mathsf W} \newcommand{\B}{\mathsf B} \title{Peaceable queens on boards of size 16 to 20} \author{Jason Davies\thanks{\href{mailto:jason@jasondavies.com}{\nolinkurl{jason@jasondavies.com}}}} \date{\clDate} \begin{document} \maketitle \begin{abstract} Let $a(n)$ be the largest $m$ such that $m$ white and $m$ black queens can be placed on an $n\times n$ board with no queen attacking a queen of the other colour (OEIS A250000). The refereed literature and the OEIS gave $a(n)$ for $n\le15$, and in 2026 Arevalo determined $a(16)$, $a(17)$ and $a(18)$ in an unrefereed, AI-assisted computational note. We prove $a(19)=\claNineteen$ and $a(20)=\claTwenty$, which were open, and we confirm $a(16)=\claSixteen$, $a(17)=\claSeventeen$ and $a(18)=\claEighteen$ independently, with two separately written programs. In each case $a(n)=\lfloor7n^2/48\rfloor$, 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 $6n-2$ 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 $4n-2$ diagonals. With symmetry breaking, the search for $n=20$ meets $\clLeavesTwentySci$ row/column labellings up to symmetry, and a single family of minimum cuts prunes every one of them. That search took $\clCpuHTwenty$ CPU hours, mostly on cloud machines. A second implementation repeats the whole search for every $n\le18$. Orbit counts by Burnside's lemma confirm that every search is complete, and exact LP certificates and SAT proofs checked by \texttt{drat-trim} give further checks. As side results we find $\clEnumSixteen$ and $\clEnumSeventeen$ inequivalent optimal configurations for $n=16$ and $n=17$ (OEIS A260680), and we confirm by computation that the $20\times20$ and $22\times22$ tori admit $\clTorusTwenty$ and $\clTorusTwentyTwo$ queens of each colour but not more (A279405), values that also follow from Harries's exact formula for even tori. \end{abstract} \noindent\textbf{AI transparency statement.} The results, the computer-assisted proofs, the code and this manuscript were produced by artificial intelligence. The human author initiated the broader research and directed the AI systems, but did not write the text and has not checked the arguments. The AI system's first literature search missed the work of Arevalo and of Harries discussed below, and an earlier version of this paper, and our edit of OEIS A250000, presented $a(16)$--$a(18)$ as new. Details are given at the end of the paper. \section{Introduction} Two queens of different colours \emph{attack} each other if they share a row, a column or a diagonal and no queen stands between them. The \emph{peaceable queens} problem asks for $a(n)$, the largest $m$ such that $m$ white and $m$ black queens can be placed on an $n\times n$ board with no white queen attacking a black queen. It is Problem~C1 of Ainley's \emph{Mathematical Puzzles}~\cite{Ainley}. Bosch posed it again in 1999 and solved small cases by integer programming~\cite{Bosch1,Bosch2}, and it is sequence A250000 of the OEIS~\cite{OEIS}. Ainley gave constructions for every $n\le30$ and a general construction of asymptotic density $7/48$. Ainley's values agree with $\lfloor7n^2/48\rfloor$ for $14\le n\le30$ except at $n=27$, where a board with $106$ queens of each colour is now known; for every other $n$ with $16\le n\le30$ Ainley's values are still the best known~\cite{OEIS}. The exact values $a(1),\dots,a(15)=0,0,1,2,4,5,7,9,12,14,17,21,24,28,32$ were obtained with several methods. Smith, Petrie and Gent~\cite{SPG} used constraint programming with symmetry breaking (see also~\cite{Petrie}), and Prestwich and Beck~\cite{PB} obtained $a(12)$ and $a(13)$. In 2014 Pratt confirmed $a(1),\dots,a(13)$ by integer programming and gave upper bounds such as $a(16)\le64$ and $a(19)\le90$. Tabatabai found $a(14)$ and $a(15)$ by integer programming in 2018 (all three in~\cite{OEIS}). The problem is also an exercise in Knuth's volume on satisfiability~\cite{Knuth}. Since $\lfloor 7n^2/48\rfloor$ matches every known value except $n=5$ and $n=9$ (where $a(n)$ is one larger), it has been asked whether Ainley's construction is optimal. Yao and Zeilberger~\cite{YZ} studied the problem numerically and symbolically, and Clinch, Drescher, Huynh and Saffidine~\cite{CDHS} record their conjecture that it is. Clinch et al.\ also proved $a(n)\le0.1716\,n^2$ for large $n$, improving the bound $n^2/4$ of van Bommel and MacEachern~\cite{vBM}, and they noted that only the first fifteen terms were known. Kane studied the asymptotics~\cite{Kane}. \paragraph{Prior and concurrent work.} Describing a placement by labels on lines is not new. Smith, Petrie and Gent~\cite[\S5]{SPG} used binary line variables (a line has no white queen, or no black queen) and remarked that one could search on the $6n$ line variables alone. Prestwich and Beck~\cite{PB} wrote an integer program with $0/1$ line variables, and the upper bounds of Clinch et al.~\cite{CDHS} use the regions cut out by the lines that meet one army. Arevalo~\cite{Arevalo} states the line-labelling reformulation of Lemma~\ref{lem:label} below, with a proof (Lemma~1 of~\cite{Arevalo}). With a search that also takes rows and columns before diagonals, the product bound $m\le|R||C|$, a bound for each diagonal family on its own, and the group $D_4\times\{\text{colour swap}\}$, Arevalo determined $a(16)=37$, $a(17)=42$ and $a(18)=47$ in August and September 2026. The note is AI-assisted and unrefereed; its runs for $n=17$ and $18$ use a single engine, and its DRUP proofs go up to $n=7$. It lists $a(19)$ as future work, and it asks, as an open question, for a joint bound over both diagonal families. Our minimum-cut Lagrangian bound (Lemmas~\ref{lem:lag} and~\ref{lem:cut}) is such a joint bound; we have not found it elsewhere. On the torus, Harries~\cite{Harries} proved an exact formula $t(2q)=H(2q)$ for even orders, with a Lean proof of the main theorem, using a line-colouring equivalence (Lemma~6 of~\cite{Harries}) and a partially dualized Lagrangian. The formula gives the torus values for $n=20$ and $22$ in Section~\ref{sec:related}, and Harries also found $t(15)=20$ and $t(17)=28$. Thus our new results are $a(19)$ and $a(20)$, the counts A260680$(11..17)$ and the minimum-cut bound; for $a(16)$--$a(18)$ and the torus our computations are independent confirmations. An earlier version of this paper, and our edit of OEIS A250000, presented $a(16)$--$a(18)$ as new, because the AI system's first literature search missed Arevalo's note. \begin{theorem}\label{thm:main} $a(16)=\claSixteen$, $a(17)=\claSeventeen$, $a(18)=\claEighteen$, $a(19)=\claNineteen$ and $a(20)=\claTwenty$. \end{theorem} The lower bounds come from known constructions. For $n=16$ we use the Ainley arrangement shown in the OEIS entry (Figure~\ref{fig:16}). For $n=17,\dots,20$ we use the boards in Kamenetsky's file of best known solutions~\cite{OEIS}. We checked each of them directly for attacks. The new content of Theorem~\ref{thm:main} is the upper bounds for $n=19$ and $20$; for $n=16,17,18$ the upper bounds confirm Arevalo's~\cite{Arevalo}. The upper bounds say that no placement has $\clTSixteen$, $\clTSeventeen$, $\clTEighteen$, $\clTNineteen$ or $\clTTwenty$ queens of each colour, respectively. \begin{figure}[htbp] \centering {\small\ttfamily \begin{tabular}{l} . . . . W W W W . . . . . . . .\\ . . . . W W W W . . . . . . . W\\ . . . . W W W W . . . . . . W W\\ . . . . W W W W . . . . . W W W\\ . . . . . W W . . . . . W W W W\\ . . . . . . . . . . . . W W W W\\ . . . . . . . . . . . . W W W .\\ . . . . . . . . . . . . W W . .\\ . . . B . . . . . . . . . . . .\\ . . B B . . . . . . . . . . . .\\ . B B B . . . . . . . . . . . .\\ B B B B . . . . . . B B . . . .\\ B B B B . . . . . B B B . . . .\\ B B B . . . . . B B B B . . . .\\ B B . . . . . . B B B B . . . .\\ B . . . . . . . B B B B . . . . \end{tabular}} \caption{An Ainley-type arrangement of $37$ white and $37$ black queens on the $16\times16$ board, as reproduced in~\cite{OEIS}.}\label{fig:16} \end{figure} \section{Line labellings} The board has $n$ rows, $n$ columns, $2n-1$ diagonals ($i-j$ constant) and $2n-1$ antidiagonals ($i+j$ constant), so $6n-2$ \emph{lines} in all. Every cell lies on exactly four lines, and distinct cells have distinct (diagonal, antidiagonal) pairs. A \emph{labelling} $x$ assigns $\W$ or $\B$ to each line. A cell is a \emph{$\W$-cell} of $x$ if all four of its lines are labelled $\W$, and a \emph{$\B$-cell} if all four are labelled $\B$. Let $W(x)$ and $B(x)$ be the numbers of $\W$-cells and $\B$-cells. No cell is both. \begin{lemma}\label{lem:label} $a(n)=\max_x\min\{W(x),B(x)\}$. \end{lemma} \begin{proof} Take a peaceable placement with $m$ queens of each colour. Suppose some line contains queens of both colours. Walking along it, we meet two consecutive queens of different colours, with no queen between them, and these two attack each other. So every line contains queens of at most one colour. Label a line by the colour of its queens, and label empty lines arbitrarily. Then every white queen stands on a $\W$-cell and every black queen on a $\B$-cell, so $\min\{W,B\}\ge m$. Conversely, given $x$, put $m=\min\{W,B\}$ white queens on $\W$-cells and $m$ black queens on $\B$-cells. A line containing queens of both colours would carry both labels, which is impossible. So no white queen shares a line with a black queen, and in particular none attacks one. \end{proof} This reformulation is known: it is Lemma~1 of Arevalo~\cite{Arevalo}, its torus form is Lemma~6 of Harries~\cite{Harries}, and binary line variables go back to~\cite{SPG,PB}. The proof shows that it does not matter whether ``attack'' allows blocking. So the question is whether some labelling has $W\ge T$ and $B\ge T$, where $T=\lfloor7n^2/48\rfloor+1$. \section{The bound} Let $R$ and $C$ be the sets of rows and columns labelled $\W$. Every $\W$-cell lies in $R\times C$ and every $\B$-cell in $R^c\times C^c$. This gives the \emph{count bound}: if some rows and columns are labelled, then $W\le r_{\W} c_{\W}$, where $r_{\W}$ and $c_{\W}$ are the numbers of rows and columns not labelled $\B$. The same bound with the colours exchanged holds for $B$. Once $(R,C)$ is fixed, call the cells of $R\times C$ \emph{$\W$-candidates} and those of $R^c\times C^c$ \emph{$\B$-candidates}. Write $x_d,y_e\in\{0,1\}$ for the labels of diagonal $d$ and antidiagonal $e$, with $1$ meaning $\W$. A $\W$-candidate on $d$ and $e$ is a $\W$-cell if and only if $x_d=y_e=1$. A $\B$-candidate is a $\B$-cell if and only if $x_d=y_e=0$. \begin{lemma}[Lagrangian bound]\label{lem:lag} For any set $X$ of labellings and any $\lambda\in[0,1]$, \[\max_{x\in X}\min\{W(x),B(x)\}\le \max_{x\in X}\{\lambda W(x)+(1-\lambda)B(x)\}.\] \end{lemma} \begin{proof} $\min\{W,B\}\le\lambda W+(1-\lambda)B$ holds for each $x$. \end{proof} \begin{lemma}[Min-cut evaluation]\label{lem:cut} Fix $(R,C)$, integers $0\le p\le Q$ and any partial labelling of the diagonals and antidiagonals. There is a network $N_p$, on a source $s$, a sink $t$ and one node for each unlabelled diagonal or antidiagonal, and a constant $G$, such that each completion $x$ satisfies $pW(x)+(Q-p)B(x)=G-\operatorname{cap}(S_x)$, where $S_x$ is the $s$--$t$ cut whose source side consists of $s$ and the lines labelled $\W$ by $x$. Hence $U_p:=\max_x\{pW+(Q-p)B\}=G-\operatorname{mincut}(N_p)$. \end{lemma} \begin{proof} For $0/1$ variables, \begin{align*} p\,xy&=p-p\,[x=0]-p\,[x=1,y=0],\\ (Q-p)(1-x)(1-y)&=(Q-p)-(Q-p)\,[x=1]-(Q-p)\,[x=0,y=1]. \end{align*} With the source side meaning $\W$, the four bracketed indicators are exactly the costs of the arcs $s\to x$, $x\to y$, $x\to t$ and $y\to x$, each of capacity $p$ or $Q-p$, in the cut $S_x$. We sum these identities over the $\W$-candidates (with $x=x_d$, $y=y_e$) and the $\B$-candidates. If a line is already labelled, we substitute its value. The term then becomes a constant (its gain, or $0$) or a single arc at the other line. Every node has arcs from $s$ and to $t$, and exactly one of these two is cut. So we may subtract the smaller of the two capacities from both and from $G$. Distinct completions give distinct cuts, and every cut arises from a completion, so the maximum over completions is $G$ minus the minimum cut. \end{proof} This bound couples the two diagonal families, which a bound for each family separately does not (compare~\cite[\S7]{Arevalo}); we have not found it in the literature. Equivalently, $pW+(Q-p)B$ is a supermodular pseudo-Boolean function of the free lines in which every term involves at most two variables. Such functions are maximised by minimum cuts \cite{Hammer,KZ}. Without the row/column stage every cell would couple four lines, and the same function would be a maximum-weight closure~\cite{Picard}. The program uses $Q=256$. \begin{corollary}[soundness needs only a feasible flow]\label{cor:sound} If $f$ is the value of any feasible $s$--$t$ flow in $N_p$ and $G-f{\raggedright}p{2.1cm}>{\raggedright}p{3.4cm}>{\raggedright\arraybackslash}p{7.2cm}} \toprule $n$ & first program & second implementation & other checks\\\midrule $\le15$ & complete & complete & definition search ($n\le\clBruteN$), CP-SAT ($n\le\clCpsatN$), SAT+DRAT ($n\le\clSatN$)\\ 16 & complete & complete & Burnside; SAT+DRAT on \clSatSixteenLeaves{} leaves; LP; replays\\ 17 & complete & complete & Burnside; LP certificates; replays\\ 18 & complete & complete (\clPqvPartsEighteen{} slices) & Burnside; LP certificates; replays\\ 19 & complete & --- & Burnside; LP certificates; \clReplayNineteen{} cloud cubes rerun locally\\ 20 & complete & --- & Burnside; LP certificates; \clReplayTwenty{} cloud cubes rerun locally\\ \bottomrule \end{tabular} \caption{What checked each upper bound. ``Burnside'' means that the number of orbits visited equals the Burnside count; ``LP'' the exact LP certificates on sampled $(R,C)$; ``replays'' reruns of random cubes with identical log lines.} \label{tab:cover} \end{table} \section{Related sequences}\label{sec:related} The same method gives side results on two related sequences. Each was computed by a single implementation only, and each reproduces all the known terms of its sequence. The counts for A260680 are new as far as we know (the OEIS gives them up to $n=10$); the torus values confirm known ones. \begin{itemize} \item \emph{Counting optimal configurations (A260680).} Two solutions are equivalent if they differ by an element of $G$. We enumerate, without symmetry breaking, all labellings with $\min\{W,B\}\ge a(n)$. We expand each into its placements and count orbits under $G$. This reproduces the known terms $1,1,1,10,3,35,19,71,18,380$ for $n\le10$ and gives $\clEnumEleven$, $\clEnumTwelve$, $\clEnumThirteen$, $\clEnumFourteen$ and $\clEnumFifteen$ for $n=11,\dots,15$. For $n=16$ the enumeration, split into $\clEnumCubesSixteen$ cubes, finds $\clEnumLabSixteen$ labellings with $\min\{W,B\}\ge37$, all with different cell sets, and $\clEnumSixteen$ inequivalent optimal configurations. Since $\clEnumLabSixteen=16\cdot\clEnumSixteen$, no optimal configuration for $n=16$ is fixed by a nontrivial element of~$G$. For $n=17$ the same enumeration finds $\clEnumLabSeventeen$ labellings with $\min\{W,B\}\ge42$ and $\clEnumSeventeen$ inequivalent optimal configurations, again $\clEnumLabSeventeen=16\cdot\clEnumSeventeen$. The split version reproduces the values for $n=10,12,13,14$ first. \item \emph{The torus (A279405).} On the $n\times n$ torus the lines are the rows, the columns and the diagonals $i\pm j\bmod n$. The same method, with the subgroup of symmetries generated by translations, the reflections $i\mapsto-i$ and $j\mapsto-j$, transposition and the colour swap, reproduces the known values for $4\le n\le14$, $n=16$ and $n=18$, each at $a(n)$ and $a(n)+1$. For $n=20$ it gives $\clTorusTwenty$, the value that Harries's formula $t(2q)=H(2q)$~\cite[Cor.~4]{Harries} already gives: a placement with $\clTorusTwenty$ of each colour exists, and $\clTorusTwentyT$ is impossible ($\clTorusPairs$ orbits, of which $\clTorusSearched$ needed a diagonal search, in $\clTorusMinutes$ CPU minutes). The repository version of the program, which can split the search into parts, caches the representatives of complements and uses unsigned masks, reproduces all these values and all the $n=20$ counters exactly. For $n=22$ it gives $\clTorusTwentyTwo=H(22)$~\cite[Table~1]{Harries}: it finds a placement with $\clTorusTwentyTwo$ white and $\clTorusTwentyTwoB$ black queens, which we checked directly for toroidal attacks, and it shows that $\clTorusTwentyTwoT$ of each colour is impossible ($\clTorusPairsTwentyTwo$ orbits, of which $\clTorusSearchedTwentyTwo$ needed a diagonal search). These two computations are therefore independent confirmations by a different method, not new values; Harries also determined $t(15)=20$ and $t(17)=28$. The value for $n=19$ is still unknown. Odd tori are harder for the method, because the root bound fails for many orbits. \end{itemize} \paragraph{Availability.} The code, logs and verification scripts are in the accompanying repository\footnote{\url{https://github.com/jasondavies/peaceable-queens}.}. The script \texttt{scripts/verify.py} rebuilds the programs and checks every number quoted here. By default this takes a few minutes. Its \texttt{-{}-full} option reruns the complete search for any $n$. The cloud runs used the dispatcher in \texttt{code/modal/}, whose returned results are logged in the same format as the local runs. \section*{Declaration of AI-generated research and authorship} This manuscript is the product of an AI-driven research process. The human author initiated a broader investigation of open problems in the OEIS, and AI systems worked on this problem within it. AI systems produced all of the following: the method, the proofs, the code, the computations and their checks, and the organisation and writing of the text. The system was Claude Opus~5.5 (Anthropic), used through Claude Code. The human author directed the AI systems but wrote no part of the manuscript; the human author also started some of the cloud computations, using commands prepared by the AI system. The AI system's first literature search missed the work of Arevalo~\cite{Arevalo} and of Harries~\cite{Harries}, which a later check found; this version credits it, and corrects the earlier version's claim that $a(16)$--$a(18)$ and the torus values for $n=20,22$ were new. The computational claims are reproduced by \texttt{scripts/verify.py}. At the time of writing, the mathematics and the code have been checked only by AI systems and by computer verification. These checks include an adversarial review of the proofs and of both search programs by an independent AI referee, who also wrote the Burnside, LP-certificate, brute-force and CP-SAT checks of Section~\ref{sec:ver}, and three rounds of external AI review of the code (ChatGPT Pro), whose findings are corrected (Section~\ref{sec:ver}). No independent human expert has reviewed the work. The human author has not read this manuscript or checked its arguments. The author takes responsibility for the accuracy of this disclosure. \raggedright \begin{thebibliography}{99} \bibitem{Ainley} S.~Ainley, \emph{Mathematical Puzzles}, G.~Bell \& Sons, London, 1977. \bibitem{Arevalo} F.~Arevalo, \emph{The sixteenth, seventeenth and eighteenth peaceable queens numbers: 37, 42, 47}, computational research note (AI-assisted), August~17, 2026, updated September~3 and~7, 2026, \url{https://fabianarevalo.com/peaceable-queens}; code at \url{https://github.com/farev/Matematica/tree/main/conjectures/peaceable-queens}. \bibitem{Bosch1} R.~A.~Bosch, \emph{Peaceably coexisting armies of queens}, Optima (Mathematical Programming Society Newsletter) \textbf{62} (1999). \bibitem{Bosch2} R.~A.~Bosch, \emph{Armies of queens, revisited}, Optima (Mathematical Programming Society Newsletter) \textbf{64} (2000), 15. \bibitem{CDHS} K.~Clinch, M.~Drescher, T.~Huynh, A.~Saffidine, \emph{Constructions, bounds, and algorithms for peaceable queens}, in: Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX 2025), SIAM, 2025, 160--167. \href{https://doi.org/10.1137/1.9781611978339.13}{doi:10.1137/1.9781611978339.13}; arXiv:2406.06974, \href{https://doi.org/10.48550/arXiv.2406.06974}{doi:10.48550/arXiv.2406.06974}. \bibitem{GT} A.~V.~Goldberg, R.~E.~Tarjan, \emph{A new approach to the maximum-flow problem}, J.\ ACM \textbf{35} (1988), 921--940. \href{https://doi.org/10.1145/48014.61051}{doi:10.1145/48014.61051}. \bibitem{Harries} J.~P.~Harries, \emph{Peaceable queens on even tori: an exact parity formula}, preprint, September~6, 2026 (first version July~27, 2026), with a Lean proof of the main theorem, \url{https://github.com/jphme/math-problems/tree/main/peaceable-queens-even-torus}. \bibitem{Hammer} P.~L.~Ivănescu (Hammer), \emph{Some network flow problems solved with pseudo-Boolean programming}, Oper.\ Res.\ \textbf{13} (1965), 388--399. \href{https://doi.org/10.1287/opre.13.3.388}{doi:10.1287/opre.13.3.388}. \bibitem{HiGHS} Q.~Huangfu, J.~A.~J.~Hall, \emph{Parallelizing the dual revised simplex method}, Math.\ Program.\ Comput.\ \textbf{10} (2018), 119--142. \href{https://doi.org/10.1007/s12532-017-0130-5}{doi:10.1007/s12532-017-0130-5}. \bibitem{PySAT} A.~Ignatiev, A.~Morgado, J.~Marques-Silva, \emph{PySAT: a Python toolkit for prototyping with SAT oracles}, in: SAT 2018, Lecture Notes in Comput.\ Sci.\ \textbf{10929}, Springer, 2018, 428--437. \href{https://doi.org/10.1007/978-3-319-94144-8_26}{doi:10.1007/978-3-319-94144-8\_26}. \bibitem{Kane} D.~M.~Kane, \emph{Asymptotic results for the queen packing problem}, preprint (2017), arXiv:1703.04538. \href{https://doi.org/10.48550/arXiv.1703.04538}{doi:10.48550/arXiv.1703.04538}. \bibitem{Knuth} D.~E.~Knuth, \emph{The Art of Computer Programming, Volume~4, Fascicle~6: Satisfiability}, Addison-Wesley, 2015, p.~180, exercise~488, and pp.~282--283. \bibitem{KZ} V.~Kolmogorov, R.~Zabih, \emph{What energy functions can be minimized via graph cuts?}, IEEE Trans.\ Pattern Anal.\ Mach.\ Intell.\ \textbf{26} (2004), 147--159. \href{https://doi.org/10.1109/TPAMI.2004.1262177}{doi:10.1109/TPAMI.2004.1262177}. \bibitem{OEIS} OEIS Foundation Inc., \emph{The On-Line Encyclopedia of Integer Sequences}, sequences A250000 (revision~379, including the comments, the extensions, and D.~Kamenetsky's file of best known solutions for $12\le n\le30$), A260680 and A279405, \url{https://oeis.org}. \bibitem{ORTools} L.~Perron, F.~Didier, \emph{CP-SAT}, OR-Tools version~9.15, Google, \url{https://developers.google.com/optimization}. \bibitem{Petrie} K.~E.~Petrie, \emph{Symmetry breaking in peaceably coexisting armies of queens}, in: CP 2002, Lecture Notes in Comput.\ Sci.\ \textbf{2470}, Springer, 2002, 763. \href{https://doi.org/10.1007/3-540-46135-3_61}{doi:10.1007/3-540-46135-3\_61}. \bibitem{Picard} J.-C.~Picard, \emph{Maximal closure of a graph and applications to combinatorial problems}, Management Sci.\ \textbf{22} (1976), 1268--1272. \href{https://doi.org/10.1287/mnsc.22.11.1268}{doi:10.1287/mnsc.22.11.1268}. \bibitem{PB} S.~Prestwich, J.~C.~Beck, \emph{Exploiting dominance in three symmetric problems}, in: Proceedings of the Fourth International Workshop on Symmetry and Constraint Satisfaction Problems (SymCon'04), 2004, 63--70. \bibitem{SciPy} P.~Virtanen et al., \emph{SciPy 1.0: fundamental algorithms for scientific computing in Python}, Nature Methods \textbf{17} (2020), 261--272. \href{https://doi.org/10.1038/s41592-019-0686-2}{doi:10.1038/s41592-019-0686-2}. \bibitem{SPG} B.~M.~Smith, K.~E.~Petrie, I.~P.~Gent, \emph{Models and symmetry breaking for `peaceable armies of queens'}, in: CPAIOR 2004, Lecture Notes in Comput.\ Sci.\ \textbf{3011}, Springer, 2004, 271--286. \href{https://doi.org/10.1007/978-3-540-24664-0_19}{doi:10.1007/978-3-540-24664-0\_19}. \bibitem{vBM} M.~F.~van Bommel, K.~T.~MacEachern, \emph{Armies of chess queens}, Math.\ Intelligencer \textbf{40}(2) (2018), 10--15. \href{https://doi.org/10.1007/s00283-017-9771-5}{doi:10.1007/s00283-017-9771-5}. \bibitem{DRAT} N.~Wetzler, M.~J.~H.~Heule, W.~A.~Hunt, \emph{DRAT-trim: efficient checking and trimming using expressive clausal proofs}, in: SAT 2014, Lecture Notes in Comput.\ Sci.\ \textbf{8561}, Springer, 2014, 422--429. \href{https://doi.org/10.1007/978-3-319-09284-3_31}{doi:10.1007/978-3-319-09284-3\_31}. \bibitem{YZ} Y.~Yao, D.~Zeilberger, \emph{Numerical and symbolic studies of the peaceable queens problem}, Exp.\ Math.\ \textbf{31} (2022), 269--279; arXiv:1902.05886. \href{https://doi.org/10.1080/10586458.2019.1616338}{doi:10.1080/10586458.2019.1616338}. \end{thebibliography} \end{document}