A q-queens problem. VII: combinatorial types of nonattacking chess riders

MaRDI QIDQ3300707zbMATH OpenFDO

Authors Christopher R. H. Hanusa, Thomas Zaslavsky

Publication date 29 July 2020

Full work available at URL https://arxiv.org/abs/1906.08981, http://ajc.maths.uq.edu.au/pdf/77/ajc_v77_p326.pdf

zbMATH Keywords

nonattacking configuration,

Mathematics Subject Classification ID

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

Abstract: On a convex polygonal chessboard, the number of combinatorial types of nonattacking configuration of three identical chess riders with $r$ moves, such as queens, bishops, or nightriders, equals $r(r^2+3r-1)/3$, as conjectured by Chaiken, Hanusa, and Zaslavsky (2019). Similarly, for any number of identical 3-move riders the number of combinatorial types is independent of the actual moves.

Recommendations

• A $q$-Queens Problem. III. Nonattacking Partial Queens
• 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. II: The square board
• Nonattacking queens in a rectangular strip

Cites work

• A $q$-Queens Problem. III. Nonattacking Partial Queens
• A q-queens problem. I: General theory
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)

Cited in

(4)

• Nonattacking Queens on a Triangle
• A $q$-Queens Problem. III. Nonattacking Partial Queens
• Counting nonattacking chess piece placements: bishops and anassas
• Counting with two-level polynomials

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A \(q\)-queens problem. VII: combinatorial types of nonattacking chess riders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300707)