Leprechauns on the chessboard

DOI10.1016/J.DISC.2021.112316MaRDI QIDQ2659226zbMATH OpenOpenAlexFDO

Authors Guillaume Escamocher, Barry O'Sullivan

Publication date 25 March 2021

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/j.disc.2021.112316

zbMATH Keywords

\(n\)-queens problemassignment diversityconstraint satisfaction

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• scientific article; zbMATH DE number 861434
• scientific article; zbMATH DE number 4127220
• scientific article; zbMATH DE number 4212061
• Greedy queens on an infinite chessboard
• The queens separation problem

Cites work

• A survey of known results and research areas for \(n\)-queens
• Algorithms and Computation
• Chasing first queens by integer programming
• Complexity of n-queens completion
• scientific article; zbMATH DE number 1727362 (Why is no real title available?)
• scientific article; zbMATH DE number 3346376 (Why is no real title available?)
• Linear congruence equations for the solutions of the N-queens problem
• On the Hamming distance of constraint satisfaction problems.
• Recent Advances in Constraints
• Soft constraints of difference and equality

Describes a project that uses

Uses Software

• COMET
• OEIS

This page was built for publication: Leprechauns on the chessboard

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