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