structural:summarization, information:filtering
Analyses of the game

In formal game theory terms, Go is a non-chance, combinatorial game with perfect information. Informally that means there are no dice used (and decisions or moves create discrete outcome vectors rather than probability distributions), the underlying math is combinatorial, and all moves (via single vertex analysis) are visible to both players (unlike some card games where some information is hidden). Perfect information also implies sequence—players can theoretically know about all past moves.

Other game theoretical taxonomy elements include the facts

In the endgame, it can often happen that the state of the board consists of several subpositions that do not interact with the others. The whole board position can then be considered as a mathematical sum, or composition, of the individual subpositions. It is this property of Go endgames that led John Horton Conway to the discovery of surreal numbers.

In combinatorial game theory terms, Go is a zero-sum, perfect-information, partisan, deterministic strategy game, putting it in the same class as chess, draughts (checkers), and Reversi (Othello).

The game emphasizes the importance of balance on multiple levels: to secure an area of the board, it is good to play moves close together; however, to cover the largest area, one needs to spread out, perhaps leaving weaknesses that can be exploited. Playing too low (close to the edge) secures insufficient territory and influence, yet playing too high (far from the edge) allows the opponent to invade. Decisions in one part of the board may be influenced by an apparently unrelated situation in a distant part of the board (for example, ladders can be broken by stones at an arbitrary distance away). Plays made early in the game can shape the nature of conflict a hundred moves later.

The game complexity of Go is such that describing even elementary strategy fills many introductory books. In fact, numerical estimates show that the number of possible games of Go far exceeds the number of atoms in the observable universe.

Go also contributed to the development of combinatorial game theory (with Go infinitesimals being a specific example of its use in Go).