Date of Award
Master of Arts in Mathematics
Chavez, Joseph D.
Griffing, Gary R.
Trapp, Rolland, and Williams, Peter
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.
Kakihara, Keiko, "Snort: A combinatorial game" (2010). Theses Digitization Project. 3705.