Sprague–Grundy theorem
Teorema de Sprague-Grundy
- Date
- 1935-1939 · confidence low
- Place
- United Kingdom
- Credited to
- Roland Sprague and Patrick Michael Grundy
- Field
- Knowledge & symbols
What was discovered
The Sprague–Grundy theorem, in combinatorial game theory, states that every impartial game under the normal play convention is equivalent to a single-heap game of nim, and can be represented by a natural number (the Grundy value or nimber) that determines its optimal strategy.
What it led to
- Unified theory of impartial combinatorial games
- Algorithmic basis for solving nim and its variants
- Applications in artificial intelligence for combinatorial games