new · 18 pairs atlas problems fields listen quant AI philosophy

algonow/algorithms/Negamax

Negamax

Pairings in the atlas

standalonestandardSymmetric game-tree search game-search

Rivals: other methods for the same problems

Alpha-beta pruning
Alpha-beta rollouts
Flat Monte Carlo
Futility pruning
Lambda search
Late move reductions
MTD(f)
Minimax
Monte Carlo tree search
NegaScout
Null-move pruning
Principal variation search
ProbCut
Quiescence search
SSS*
Scout algorithm

Where it sits

game-search · Search, Constraints & Games

Every entry is a real named method. Pairs that share a problem are rivals; that is the point. The live lessons ▸

Created by Eric Allione