Computing Tighter Bounds on the $n$-Queens Constant via Newton's Method

In recent work Simkin shows that bounds on an exponent occurring in the famous n-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.

[1]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[2]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[3]  Michael Simkin,et al.  A Lower Bound for the n-queens Problem , 2022, Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

[4]  Yousef Saad,et al.  Iterative methods for sparse linear systems , 2003 .

[5]  Michael Simkin The number of $n$-queens configurations , 2021 .

[6]  Brett Stevens,et al.  A survey of known results and research areas for n-queens , 2009, Discret. Math..

[7]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[8]  M. Hestenes,et al.  Methods of conjugate gradients for solving linear systems , 1952 .

[10]  G. Strang Introduction to Applied Linear Algebra: Vectors, Matrices, and Least Squares [Bookshelf] , 2020, IEEE Control Systems.