  This thesis will be discussing scoring play combinatorial games and looking
at the general structure of these games under different operators. I will also
be looking at the Sprague-Grundy values for scoring play impartial games, and
demonstrating that there is an easily computable function that will solve a
large range of octal games easily. I will also be demonstrating that my theory
can readily be applied to the scoring play game of Go and can lead to a much
greater understanding of the game.
