Counting kings: as easy as _1,_2,_3

MaRDI QIDQ3429476zbMATH OpenFDO

Authors Neil J. Calkin, Shannon Purvis, Shaina Race, Keith Schneider, Kevin James, Matthew Yancey

Publication date 2 April 2007

zbMATH Keywords

chessboardconfigurations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Recommendations

• The problem of the kings
• The problem of kings
• Non-attacking Bishop and King positions on regular and cylindrical chessboards
• On the queen domination problem
• On the domination of kings

Cited in

(4)

• Arranging kings \(k\)-dependently on hexagonal chessboards
• Counting kings: explicit formulas, recurrence relations, and generating functions! Oh my!
• Non-attacking Bishop and King positions on regular and cylindrical chessboards
• Counting king permutations on the cylinder

This page was built for publication: Counting kings: as easy as \(\lambda_1,\lambda_2,\lambda_3\dots\)

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