Date of Award
2010
Document Type
Thesis
Degree Name
Master of Arts in Mathematics
Department
Mathematics
First Advisor
Chavez, Joseph D.
Second Advisor
Griffing, Gary R.
Third Advisor
Trapp, Rolland, and Williams, Peter
Abstract
This paper focuses on the game Snort, which is a combinatorial game on graphs. This paper will explore the characteristics of opposability through examples. More fully, we obtain some neccessary conditions for a graph to be opposable. Since an opposable graph guarantees a second player win, we examine graphs that result in a first player win.
Recommended Citation
Kakihara, Keiko, "Snort: A combinatorial game" (2010). Theses Digitization Project. 3705.
https://scholarworks.lib.csusb.edu/etd-project/3705
