Zermelo's theorem
Teorema de Zermelo
- Date
- 1913 · confidence high
- Place
- Zurich, Switzerland
- Credited to
- Ernst Zermelo
- Field
- Knowledge & symbols
What was discovered
A game-theory theorem proving that, in any finite two-player game with perfect information and no possible draws, one of the two players must have a winning strategy; formulated by Ernst Zermelo with respect to chess.
What it led to
- Foundational result in combinatorial game theory
- Basis for later results on solved games
- Influenced game-tree search algorithms (minimax)