Combinatorial game theory deals with games of pure strategy with NO random
devices such as dice or cards, and where both players have perfect
information.  One example is the game of NIM, which has been completely
solved.  We have applied the theory to a one-dimensional version of the
Chinese game of Go to find an optimal strategy for both players.