The game of Go is very old and very simple. It has been played for at least 2500 years, and the complexity level, for humans, is similar to that of chess. For computers chess is substantially easier; while programs have beat the best chess players, no computer program is on the level of even the weakest professional Go player.
In this paper I show how we can apply simple graph theory techniques to Go, proving some simple results. While these results are original to this paper, none of them depart very far from approaches we've used in class.