A \(q\)-queens problem. II: The square board

DOI10.1007/s10801-014-0547-0zbMath1314.05008arXiv1402.4880OpenAlexW2022368350MaRDI QIDQ2346755

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

Publication date: 4 June 2015

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

arrangement of hyperplanesEhrhart theoryinside-out polytopefairy chess piecesnonattacking chess pieces

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Recreational mathematics (00A08)

Related Items

A \(q\)-queens problem IV. Attacking configurations and their denominators, A billiards-like dynamical system for attacking chess pieces, A \(q\)-queens problem. I: General theory, A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders, A q-queens problem. VI. The bishops' period, A $q$-Queens Problem. III. Nonattacking Partial Queens

Cites Work

• A \(q\)-queens problem. I: General theory
• A survey of known results and research areas for \(n\)-queens
• Lattice invariant valuations on rational polytopes