Related articles:
A Theory of Justice
Alpha-beta pruning
Computer chess
Decision theory
Game theory
John von Neumann
Nash equilibrium
Zero-sum
Key terms:
algorithm
b chooses
b will choose
best move
chances
chess
child node
chooses
combinatorial game theory
decision theory
each node
each player
estimator
evaluation function
game theory
game tree
heuristic
loss function
maximin
maximizing
maximizing player
minimax
minimax algorithm
minimax theorem
minimizing
minimizing player
minimum
mixed strategy
negative infinity
no matter what
node
one move
ordinal
outcomes
own minimum
payoff
payoff possible
player b
plies
pruning
rawls
regret
s strategy
simultaneous
strategy
then b
theta
theta r
will choose
will lead
Search external links cited by footnotes on Wikipedia page Minimax:
|
|