Algorithm performance for chessboard separation problems

MaRDI QIDQ3567794zbMATH OpenFDO

Authors R. Douglas Chatham, Maureen Doyle, John J. Miller, Amber M. Rogers, R. Duane Skaggs, Jeffrey Ward

Publication date 17 June 2010

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Recommendations

• Centrosymmetric solutions to chessboard separation problems
• scientific article; zbMATH DE number 2140326
• A bit computing algorithm for the N-queens problem
• Evaluation and comparison of brute-force search and constrained optimization algorithms to solve the N-Queens problem
• Chess: a cover-up

Cited in

(9)

• Some results for chessboard separation problems
• A brute-force solution to the 27-queens puzzle using a distributed computation
• An alternative efficient chessboard representation based on 4-bit piece coding
• Centrosymmetric solutions to chessboard separation problems
• Chess: a cover-up
• A new mathematical model for tiling finite regions of the plane with polyominoes
• A bit computing algorithm for the N-queens problem
• scientific article; zbMATH DE number 5642148 (Why is no real title available?)
• scientific article; zbMATH DE number 2140326 (Why is no real title available?)

This page was built for publication: Algorithm performance for chessboard separation problems

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