A $q$-Queens Problem. III. Nonattacking Partial Queens
From MaRDI portal
Publication:5197599
zbMath1419.05015arXiv1402.4886MaRDI QIDQ5197599
Christopher R. H. Hanusa, Seth Chaiken, Thomas Zaslavsky
Publication date: 19 September 2019
Full work available at URL: https://arxiv.org/abs/1402.4886
arrangement of hyperplanesEhrhart theoryinside-out polytopefairy chess piecesnonattacking chess pieces
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15)
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. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders, A q-queens problem. VI. The bishops' period, A q-queens problem. VII. Combinatorial types of nonattacking chess riders
Uses Software
Cites Work
- A \(q\)-queens problem. I: General theory
- A \(q\)-queens problem IV. Attacking configurations and their denominators
- A \(q\)-queens problem. II: The square board
- A $q$-Queens Problem. V. Some of Our Favorite Pieces: Queens, Bishops, Rooks, and Nightriders
- A q-queens problem. VI. The bishops' period
- Unnamed Item