minimax(redirected from Bottleneck programming)
Also found in: Dictionary.
in mathematics, the value of the expression
of a real function f(x,y) of two variables. The concept of maximin equal to maxy minxf(x, y) is related to the concept of minimax. In the theory of zero-sum games, the fundamental optimality principle is the minimax principle, which consists in the attempt of a player to minimize his loss, assuming that his opponent’s strategy takes the most unfavorable form.
The above algorithm will give every move a value of positive or negative infinity since the value of every move will be the value of some final winning or losing move. This can be extended if we can supply a heuristic evaluation function which gives values to non-final game states without considering all possible following complete sequences. We can then limit the minimax algorithm to look only a certain number of moves ahead. This number is called the "look-ahead" or "ply".
See also alpha/beta pruning.