Two players, perfect information, no chance, both playing optimally. Nearly every such problem reduces to labelling positions W (winning) or L (losing), or to a Grundy value.
- Combinatorial Games — the general framework
- Nim
- Grundy Numbers (Sprague-Grundy) · the theorem
- Nim Variants — Misère, Moore’s Nim_k, staircase, Wythoff
- Minimax · Minimax Algorithm
- Alpha-Beta Pruning · Negascout
- Monte Carlo Tree Search · UCT
- Game DP
- Surreal Numbers and Hackenbush
See also: Exact / NP-Hard · Proof-Number Search