Negamax Search

Some articles on negamax search, search, negamax:

... Negamax search is a variant form of minimax search that relies on the zero-sum property of a two-player game ... an algorithm to compute the minimax or negamax value quickly by clever use of alpha-beta pruning discovered in the 1980s ... alpha-beta pruning is itself a way to compute the minimax or negamax value of a position quickly by avoiding the search of certain uninteresting positions ...

Famous quotes containing the word search:

    The search for the truth is the most important work in the whole world, and the most dangerous.
    James Clavell (b. 1924)