scientific article; zbMATH DE number 436080

MaRDI QIDQ3139865zbMATH OpenFDO

Authors Marguerite A. Eisenstein-Taylor, Charles M. Grinstead, Bruce Hahne, David van Stone

Publication date 13 June 1995

zbMATH Keywords

chessboardqueen dominationqueens

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Other designs, configurations (05B30)

Recommendations

• On the queen domination problem
• The queens separation problem
• On the diagonal queens domination problem
• scientific article; zbMATH DE number 3993597
• scientific article; zbMATH DE number 861358
• scientific article; zbMATH DE number 1051284
• The \(n\)-queens completion problem
• A generalization of the \(n\)-queen problem
• scientific article; zbMATH DE number 4212061
• scientific article; zbMATH DE number 4127220

Cited in

(23)

• The crippled Queen placement problem
• Queens on non-square tori
• Piercing the Chessboard
• scientific article; zbMATH DE number 3933079 (Why is no real title available?)
• Chasing first queens by integer programming
• On the queen domination problem
• The number of \(n\)-queens configurations
• κ-Dependence and Domination in Kings Graphs
• Domination by queens on a square beehive
• On the diagonal queens domination problem
• scientific article; zbMATH DE number 4174934 (Why is no real title available?)
• scientific article; zbMATH DE number 4127220 (Why is no real title available?)
• scientific article; zbMATH DE number 3993597 (Why is no real title available?)
• Domination and irredundance in the queens' graph
• The queens separation problem
• An upper bound for the minimum number of queens covering the \(n {\times} n\) chessboard
• The \(n\)-queens completion problem
• Domination in chessboards
• The \(n\) queens problem with forbidden squares
• Domination of the rectangular queen's graph
• When rooks miss: probability through chess
• Computing tighter bounds on the \(n\)-queens constant via Newton's method
• Repeatedly applying the combinatorial Nullstellensatz for zero-sum grids to Martin Gardner's minimum no-3-in-a-line problem

This page was built for publication:

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