An application of graph theory and integer programming: Chessboard non-attacking puzzles

• المؤلفون الرئيسيون: Dela Merced, Cherie P., Delos Santos, Nadja Barbra P.G.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 1991
• الموضوعات: Graph theory; Integer programming; Puzzles; Chess
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_bachelors/15971
• المؤسسة: De La Salle University

This paper is an exposition of the theorems given in the article An Application of Graph Theory and Integer Programming: Chessboard Non-attacking puzzles by L.R. Foulds and D.G. Johnston. Problems in chess such as: Where in the chessboard can a piece be placed so that it will not be attacked by anot...