Publication Date

2021

Degree Level

B.S.

Program

Mathematics

Document Type

Thesis

Abstract

The Angel Problem, first introduced in 1982, is a two-player combinatorial game played on an infinite playing field. These two players, named the angel and the devil, move around the playing field, with the devil trying to trap the angel and the angel evading capture. The problem of capturing the angel on the playing field resulted in many variants of the original game that attempt to solve this problem. In the spirit of these variants, this research focuses on a new type of angel and devil, named the duck and fox, respectively, both limited by a finite playing field, and attempts to answer to the question: what is the smallest finite area in which the fox can trap the duck?

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.