A \(q\)-queens problem IV. Attacking configurations and their denominators

DOI10.1016/j.disc.2019.111649zbMath1429.05010arXiv1807.04741OpenAlexW2977289446MaRDI QIDQ2279971

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

Publication date: 17 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

arrangement of hyperplanesEhrhart theoryinside-out polytopefairy chess piecesnonattacking chess piecesdiscrete Fibonacci spiral

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (4)

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. III. Nonattacking Partial Queens

Uses Software

• OEIS

Cites Work

• A \(q\)-queens problem. I: General theory
• A survey of known results and research areas for \(n\)-queens
• A \(q\)-queens problem. II: The square board
• Inside-out polytopes
• The n-Queens Problem
• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A q-queens problem. VI. The bishops' period

This page was built for publication: A \(q\)-queens problem IV. Attacking configurations and their denominators