A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders

DOI10.4134/JKMS.j190682zbMath1456.05005arXiv1609.00853OpenAlexW3099199704MaRDI QIDQ5147412

Thomas Zaslavsky, Seth Chaiken, Christopher R. H. Hanusa

Publication date: 26 January 2021

Full work available at URL: https://arxiv.org/abs/1609.00853

zbMATH Keywords

arrangement of hyperplanesEhrhart theoryinside-out polytopefairy chess piecesnonattacking chess pieces

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Orthogonal arrays, Latin squares, Room squares (05B15) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Recreational mathematics (00A08)

Related Items (3)

A Plethora of Polynomials: A Toolbox for Counting Problems ⋮ A billiards-like dynamical system for attacking chess pieces ⋮ A $q$-Queens Problem. III. Nonattacking Partial Queens

Uses Software

• OEIS

Cites Work

• A \(q\)-queens problem. I: General theory
• Stirling polynomials
• A billiards-like dynamical system for attacking chess pieces
• A \(q\)-queens problem IV. Attacking configurations and their denominators
• A \(q\)-queens problem. II: The square board
• Inside-out polytopes
• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A q-queens problem. VI. The bishops' period
• Closed-Form Expressions for the n-Queens Problem and Related Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders