Finding an optimal solution for the game of checkers

Date of Publication

1996

Document Type

Bachelor's Thesis

Degree Name

Bachelor of Science in Mathematics

College

College of Science

Department/Unit

Mathematics and Statistics

Abstract/Summary

The thesis presents an optimal solution for the game of checkers. The problem is to use mathematics in determining the fastest way of reaching a set of prescribed points of destination from some prescribed points of origin, with no opponent in the way. The study aims to expose the undergraduate mathematics student to concepts not usually encountered in their mathematical courses, and to enhance their problem solving skills.

This study is an exposition of the results found in the article Optimal Leapfrogging by Auslander, Benjamin, and Wilkerson which was published in February 1993 [1]. The definitions and theorems contained in this paper were obtained from the aforementioned reference material. These theorems were then proven, and examples were given to make the definitions clear.

Abstract Format

html

Language

English

Format

Print

Accession Number

TU07656

Shelf Location

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

Physical Description

45 leaves

Keywords

Checkers; Mathematical optimization; Game theory; Vector spaces

This document is currently not available here.

Share

COinS