Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game . This algorithm relies on the fact that max(a, b) = -min(-a, -b) to simplify the implementation of the minimax algorithm. More precisely, the value of a position to player A in such a game is the negation of the value to player B. Thus, the player on move looks for a move that maximizes the negation of the value of the position resulting from the move: this successor position must by definition have been valued by the opponent.
Read full article from Negamax - Wikipedia, the free encyclopedia
No comments:
Post a Comment