[Paper Review] A $q$-Queens Problem

Seth Chaiken, Christopher R. H. Hanusa+1 more|arXiv (Cornell University)|Mar 8, 2013

Advanced Combinatorial Mathematics12 references9 citations

TL;DR

This paper develops a quasipolynomial formula using Ehrhart theory of inside-out polytopes to count nonattacking placements of $q$ identical chess pieces with unbounded straight-line moves—like the queen—on a polygonal convex board of variable size $n$. The key result is that the number of combinatorially distinct configurations equals the quasipolynomial evaluated at $n = -1$, with coefficients determined by a matroid of weighted graphs tied to line incidences in the plane.

ABSTRACT

By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, on a polygonal convex board. The number of ways to place $q$ identical nonattacking pieces on a board of variable size $n$ but fixed shape is given by a quasipolynomial function of $n$, of degree $2q$, whose coefficients are polynomials in $q$. The number of combinatorially distinct types of nonattacking configuration is the evaluation of our quasipolynomial at $n=-1$. The quasipolynomial has an exact formula that depends on a matroid of weighted graphs, which is in turn determined by incidence properties of lines in the real affine plane. We study the highest-degree coefficients and also the period of the quasipolynomial, which is needed if the quasipolynomial is to be interpolated from data, and which is bounded by some function, not well understood, of the board and the piece's move directions. In subsequent parts we specialize to the square board and then to subsets of the queen's moves, and we prove exact formulas (most but not all already known empirically) for small numbers of queens, bishops, and nightriders. Each part concludes with open questions, both specialized and broad.

Motivation & Objective

• To develop a general counting framework for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, on convex polygonal boards.
• To establish that the number of such placements for $q$ identical pieces on a board of size $n$ is a quasipolynomial in $n$ of degree $2q$.
• To show that the number of combinatorially distinct configurations corresponds to evaluating the quasipolynomial at $n = -1$.
• To characterize the structure of the quasipolynomial through a matroid of weighted graphs derived from line incidences in the real affine plane.

Proposed method

• Apply Ehrhart theory of inside-out polytopes to model nonattacking configurations as integer points in rational polytopes with forbidden hyperplanes.
• Represent the configuration space as a union of relative open polytopes, each corresponding to a distinct combinatorial type of placement.
• Use the theory of quasipolynomials to derive a degree-$2q$ function in $n$ whose coefficients are polynomials in $q$, encoding the number of placements.
• Construct a matroid of weighted graphs based on incidence relations of lines in the real affine plane that define the move directions of the piece.
• Derive exact formulas for the highest-degree coefficients of the quasipolynomial using geometric and combinatorial properties of the board and move vectors.
• Analyze the period of the quasipolynomial, which governs its interpolation, and relate it to the board’s geometry and move direction symmetries.

Experimental results

Research questions

• RQ1 How can the number of nonattacking placements of $q$ identical chess pieces with unbounded straight-line moves be expressed as a function of board size $n$?
• RQ2 What is the algebraic and combinatorial structure of the quasipolynomial that counts these configurations, and how do its coefficients depend on the board and piece type?
• RQ3 Why does evaluating the quasipolynomial at $n = -1$ yield the number of combinatorially distinct configuration types?
• RQ4 What determines the period of the quasipolynomial, and how does it relate to the geometry of the board and the move directions of the piece?
• RQ5 Can exact formulas for small $q$ be derived for specific pieces like queens, bishops, and nightriders, and what patterns emerge?

Key findings

• The number of nonattacking placements of $q$ identical pieces on a convex polygonal board of size $n$ is a quasipolynomial in $n$ of degree $2q$, with coefficients that are polynomials in $q$.
• The number of combinatorially distinct configuration types is given by evaluating the quasipolynomial at $n = -1$, a result derived from Ehrhart theory of inside-out polytopes.
• The quasipolynomial is fully determined by a matroid of weighted graphs constructed from incidence relations of lines in the real affine plane corresponding to the piece’s move directions.
• The highest-degree coefficients of the quasipolynomial are explicitly characterized and depend on geometric invariants of the board and the piece’s move vectors.
• The period of the quasipolynomial is bounded by a function of the board and move direction symmetries, though this function remains poorly understood.
• Exact formulas for small numbers of queens, bishops, and nightriders are derived, many of which confirm previously known empirical results.