Numerical and Symbolic Studies of the Peaceable Queens Problem

2019/02/15 by Yukun Yao, Doron Zeilberger, Yao, Yukun +1 · 1 citation
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications #Polynomial and algebraic computation

paper · pdf · doi:10.48550/arxiv.1902.05886

openalex publication_date 2019/02/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss, and make partial progress on, the peaceable queens problem, the protagonist of OEIS sequence A250000. Symbolically, we prove that Jubin's construction of two pentagons is at least a local optimum. Numerically, we find the exact numerical optimums for some specific configurations. Our method can be easily applied to more complicated configurations with more parameters.

Citations

• The on-line encyclopedia of integer sequences

Cited by

• On graph automorphisms related to Snort

Related

• Constructions, bounds, and algorithms for peaceable queens
• Closed-Form Expressions for the n-Queens Problem and Related Problems
• Linear algorithm for solution n-Queens Completion problem
• Finding First and Most-Beautiful Queens by Integer Programming
• The n-queens completion problem