On Playing Well in a Sum of Games

Many games are naturally described as a sum of games, e.g., nim and the endgame of Go. Let G ,...,G represent n games. Then a move in the sum G + ...+G consists of picking a component game G and making a move in G .. This thesis analyzes play in a sum of games from three different perspective: computational complexity, approximate solutions, and optimal research algorithms.