Negamax
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 resulting from the move: this successor position must by definition have been valued by the opponent. The reasoning of the previous sentence works regardless of whether A or B is on move. This means that a single procedure can be used to value both positions. This is a coding simplification over minimax, which requires that A selects the move with the maximum-valued successo
Negamax
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 resulting from the move: this successor position must by definition have been valued by the opponent. The reasoning of the previous sentence works regardless of whether A or B is on move. This means that a single procedure can be used to value both positions. This is a coding simplification over minimax, which requires that A selects the move with the maximum-valued successo
has abstract
Il negamax è una piccola varia ...... forme dell'algoritmo negamax.
@it
Negamax es una variante del al ...... e algoritmo llamado negascout.
@es
Negamax search is a variant fo ...... g some form of negamax search.
@en
thumbnail
Wikipage page ID
Wikipage revision ID
741,846,420
subject
hypernym
comment
Il negamax è una piccola varia ...... mossa con il massimo valore di
@it
Negamax es una variante del al ...... nor.
* max(x, y)=-min(-x,-y)
@es
Negamax search is a variant fo ...... th the maximum-valued successo
@en
label
Negamax
@en
Negamax
@es
Negamax
@it