Abstract
dc:description.abstractThis 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Arts in Mathematics
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematics
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Kakihara, Keiko
- Contributors dc:contributor
-
- Chavez, Joseph D.
- Griffing, Gary R.
- Trapp, Rolland, and Williams, Peter
Subjects
dc:subject × 13- Game theory
- Graph theory
- Games Mathematics
- Mathematics Graphic methods
- Combinatorial analysis
- Combinatorial optimization
- Mathematical analysis
- Problem solving Mathematical models
- Programming (Mathematics)
- Decision making Mathematical models
- Internet Mathematical models
- Algorithms
- Discrete Mathematics and Combinatorics
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://scholarworks.lib.csusb.edu/etd-project/3705