An application of graph theory and integer programming: Chessboard non-attacking puzzles
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1991
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/15971 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16484 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-164842022-01-24T05:54:47Z An application of graph theory and integer programming: Chessboard non-attacking puzzles Dela Merced, Cherie P. Delos Santos, Nadja Barbra P.G. 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 another piece of the same kind? and What is the maximum number of pieces of the same kind can be placed on a chessboard so that they will not attack each other are discussed. Solutions are presented using Graph Theory and Integer Programming. 1991-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/15971 Bachelor's Theses English Animo Repository Graph theory Integer programming Puzzles Chess |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Graph theory Integer programming Puzzles Chess |
| spellingShingle |
Graph theory Integer programming Puzzles Chess Dela Merced, Cherie P. Delos Santos, Nadja Barbra P.G. An application of graph theory and integer programming: Chessboard non-attacking puzzles |
| description |
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 another piece of the same kind? and What is the maximum number of pieces of the same kind can be placed on a chessboard so that they will not attack each other are discussed. Solutions are presented using Graph Theory and Integer Programming. |
| format |
text |
| author |
Dela Merced, Cherie P. Delos Santos, Nadja Barbra P.G. |
| author_facet |
Dela Merced, Cherie P. Delos Santos, Nadja Barbra P.G. |
| author_sort |
Dela Merced, Cherie P. |
| title |
An application of graph theory and integer programming: Chessboard non-attacking puzzles |
| title_short |
An application of graph theory and integer programming: Chessboard non-attacking puzzles |
| title_full |
An application of graph theory and integer programming: Chessboard non-attacking puzzles |
| title_fullStr |
An application of graph theory and integer programming: Chessboard non-attacking puzzles |
| title_full_unstemmed |
An application of graph theory and integer programming: Chessboard non-attacking puzzles |
| title_sort |
application of graph theory and integer programming: chessboard non-attacking puzzles |
| publisher |
Animo Repository |
| publishDate |
1991 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/15971 |
| _version_ |
1772835019215077376 |