An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles

DOI10.2307/2689591MaRDI QIDQ3337497zbMATH OpenOpenAlexFDO

Authors Les R. Foulds, D. G. Johnston

Publication date 1984

Full work available at URL https://doi.org/10.2307/2689591

zbMATH Keywords

0-1 integer programmingChessboard non-attacking puzzlesmaximal cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10)

Recommendations

• Chasing first queens by integer programming
• scientific article; zbMATH DE number 861434
• Graph theory problems from hexagonal and traditional chess
• A maximum flow algorithm to locate non-attacking queens of an n n chessboard
• Computational methods and new results for chessboard problems

Cited in

(4)

• Linear congruence equations for the solutions of the N-queens problem
• Designing Game of Life mosaics with integer programming
• Complexity of chess domination problems
• A survey of known results and research areas for \(n\)-queens

This page was built for publication: An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles

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