Enumerating Rook and Queen paths

MaRDI QIDQ3012453zbMATH OpenFDO

Authors Suren L. Fernando, Khang Tran, Martin J. Erickson

Publication date 6 July 2011

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Queens in exile: non-attacking queens on infinite chess boards
• A \(q\)-queens problem. II: The square board
• Rook endgame problems in \(m\) by \(n\) chess
• Maharaja Nim: Wythoff's queen meets the knight
• A \(q\)-queens problem. V: Some of our favorite pieces: queens, bishops, rooks, and nightriders

Cited in

(5)

• The research and progress of the enumeration of lattice paths
• Explicit formula for the generating series of diagonal 3D rook paths
• A class of polynomials from enumerating queen paths
• Counting paths on a chessboard with a barrier
• The computational challenge of enumerating high-dimensional rook walks

This page was built for publication: Enumerating Rook and Queen paths

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