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 min ( a , b ) = − max ( − b , − a ) {\displaystyle \min(a,b)=-\max(-b,-a)} to simplify the implementation of the minimax algorithm.
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 min ( a , b ) = − max ( − b , − a ) {\displaystyle \min(a,b)=-\max(-b,-a)} to simplify the implementation of the minimax algorithm.
Source: Wikipedia "Negamax" · CC BY-SA 4.0
Share this article: X · Bluesky