A \(q\)-queens problem. I: General theory

zbMath1298.05021arXiv1303.1879MaRDI QIDQ740671

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

Publication date: 9 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

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) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Recreational mathematics (00A08)

Related Items

Chained permutations and alternating sign matrices -- inspired by three-person chess, A \(q\)-queens problem IV. Attacking configurations and their denominators, A billiards-like dynamical system for attacking chess pieces, 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. II: The square board, A $q$-Queens Problem. III. Nonattacking Partial Queens, A q-queens problem. VII. Combinatorial types of nonattacking chess riders

Cites Work

• Unnamed Item
• Unnamed Item
• Nonattacking queens in a rectangular strip
• A survey of known results and research areas for \(n\)-queens
• Lattice invariant valuations on rational polytopes
• A \(q\)-queens problem. II: The square board
• Inside-out polytopes
• Determinants in the Kronecker product of matrices: the incidence matrix of a complete graph
• Computing the Continuous Discretely
• The n-Queens Problem