Computing Tighter Bounds on the $n$-Queens Constant via Newton's Method
Optimization and Control
2023-05-24 v2 Combinatorics
Abstract
In recent work Simkin shows that bounds on an exponent occurring in the famous -queens problem can be evaluated by solving convex optimization problems, allowing him to find bounds far tighter than previously known. In this note we use Simkin's formulation, a sharper bound developed by Knuth, and a Newton method that scales to large problem instances, to find even sharper bounds.
Keywords
Cite
@article{arxiv.2112.03336,
title = {Computing Tighter Bounds on the $n$-Queens Constant via Newton's Method},
author = {Parth Nobel and Akshay Agrawal and Stephen Boyd},
journal= {arXiv preprint arXiv:2112.03336},
year = {2023}
}