Closed-Form Expressions for the n-Queens Problem and Related Problems

TL;DR

This paper introduces novel closed-form formulas for the n-queens problem and related combinatorial problems using matrix permanents, providing new polynomial space solutions and bounds.

Contribution

It presents the first closed-form expressions for these problems and links them to permanents, enabling polynomial space solutions with nontrivial time complexity bounds.

Findings

Derived closed-form formulas for n-queens and related problems

Established polynomial space solutions with complexity bounds

Proved lower bounds using permanents of complex matrices

Abstract

In this paper, we derive simple closed-form expressions for the $n$-queens problem and three related problems in terms of permanents of $(0,1)$ matrices. These formulas are the first of their kind. Moreover, they provide the first method for solving these problems with polynomial space that has a nontrivial time complexity bound. We then show how a closed-form for the number of Latin squares of order $n$ follows from our method. Finally, we prove lower bounds. In particular, we show that the permanent of Schur's complex valued matrix is a lower bound for the toroidal semi-queens problem, or equivalently, the number of transversals in a cyclic Latin square.