Finding an optimal solution for the game of checkers
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 math...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1996
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16341 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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. |
|---|