Minimax Algorithm

Some articles on minimax algorithm, algorithm:

Combinatorial Game Theory - Minimax Algorithm With Alternate Moves
... A minimax algorithm is a recursive algorithm for choosing the next move in an n-player game, usually a two-player game ... A is called the maximizing player and B is called the minimizing player, hence the name minimax algorithm ... The above algorithm will assign a value of positive or negative infinity to any position since the value of every position will be the value of some ...
Minimax - Combinatorial Game Theory
... In combinatorial game theory, there is a minimax algorithm for game solutions ... A simple version of the minimax algorithm, stated below, deals with games such as tic-tac-toe, where each player can win, lose, or draw ... The Minimax algorithm helps find the best move, by working backwards from the end of the game ...