Negamax
id:
negamax-319-8106164
title:
Negamax
text:
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 = − max 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 th
brand slug:
wiki
category slug:
encyclopedia
description:
A variation of minimax game tree search
original url:
https://en.wikipedia.org/wiki/Negamax
date created:
date modified:
2023-09-12T19:36:22Z
main entity:
{"identifier":"Q3874238","url":"https://www.wikidata.org/entity/Q3874238"}
image:
fields total:
13
integrity:
14