Difference between revisions of "Minimax"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 19: | Line 19: | ||
* [[Negascout]] | * [[Negascout]] | ||
* [[Non-cooperative game]] | * [[Non-cooperative game]] | ||
| + | * [[Normal-form game]] | ||
* [[Sion's minimax theorem]] | * [[Sion's minimax theorem]] | ||
* [[Transposition table]] | * [[Transposition table]] | ||
Latest revision as of 16:52, 24 May 2016
Minimax (sometimes MinMax or MM) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario.
Description
Originally formulated for two-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.
See also
- Alpha-beta pruning
- Claude Shannon
- Computer chess
- Expectiminimax
- Game theory
- Horizon effect
- Minimax Condorcet
- Monte Carlo tree search
- Minimax regret
- Negamax
- Negascout
- Non-cooperative game
- Normal-form game
- Sion's minimax theorem
- Transposition table
- Wald's maximin model
External links
- Minimax @ Wikipedia
