Title

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

Date of Publication

1991

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics Department

Abstract/Summary

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.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU05723

Shelf Location

Archives, The Learning Commons, 12F Henry Sy Sr. Hall

Physical Description

108 leaves

Keywords

Graph theory; Integer programming; Puzzles; Chess

This document is currently not available here.

Share

COinS