Develops the mathematical techniques for solving late-stage endgame problems in the game Go. As a typical game of Go approaches its conclusion, the active areas of play become independent of one another and the overall board position may be regarded as a sum of disconnected partial board positions. The authors apply combinatorial game theory to solving Go-related problems with a bewildering choice of similar-looking moves and subtle priority relationships.