Date on Honors Thesis

Fall 11-21-2020



Examining Committee Member

Elizabeth Donovan, PhD, Advisor

Examining Committee Member

Robert Donnelly ,PhD, Committee Member

Examining Committee Member

Leslie Wiglesworth, PhD, Committee Member


Games on graphs are a well studied subset of combinatorial games. Balance and strategies for winning are often looked at in these games. One such combinatorial graph game is Grim. Many of the winning strategies of Grim are already known. We note that many of these winning strategies are only available to the first player. Hoping to develop a fairer Grim, we look at Grim played under a slighlty different rule set. We develop winning strategies and known outcomes for this altered Grim. Throughout, we discuss whether our altered Grim is a fairer game then the original.

Creative Commons License

Creative Commons Attribution-Noncommercial 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 License