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: | Dela Merced, Cherie P., Delos Santos, Nadja Barbra P.G. |
---|---|
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 |
Similar Items
-
On the knight's tour on the fifteen puzzle
by: Marcelino, Bernice Lhee C., et al.
Published: (1997) -
Which rectangular chessboards have a knight's tour?
by: Laureola, Lorenz M., et al.
Published: (1993) -
A pebbled chessboard (with a computer program)
by: Catoto, Eulalio Carlo M., et al.
Published: (1997) -
A note on lights-out-puzzle: Parity-state graphs
by: Gervacio, Severino V., et al.
Published: (2011) -
On the knight's tour on the fifteen puzzle and the topspin puzzle
by: Gavino, Albert D., et al.
Published: (1998)