Papers › Improved lower bounds for Queen's Domination via an exactly-solvable relaxation
Improved lower bounds for Queen's Domination via an exactly-solvable relaxation
Archit Karandikar, Akashnil Dutta
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Queen's Domination problem, studied for over 160 years, poses the following question: What is the least number of queens that can be arranged on a m ×n chessboard so that they either attack or occupy every cell? We propose a novel relaxation of the Queen's Domination problem and show that it is exactly solvable on both square and rectangular chessboards. As a consequence, we improve on the best known lower bound for rectangular chessboards in ≈12.5% of the non-trivial cases. As another consequence, we simplify and generalize the proofs for the best known lower-bounds for Queen's Domination of square n ×n chessboards for n ≡{0,1,2} 4 using an elegant idea based on a convex hull. Finally, we show some results and make some conjectures towards the goal of simplifying the long complicated proof for the best known lower-bound for square boards when n ≡3 4 (and n > 11). These simple-to-state conjectures may also be of independent interest.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections