-
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)\ ,}
minimax may
often be
simplified into the
negamax algorithm.
Suppose the game
being pla**** only has a
maximum of two possible...
-
typically at a
heavy cost in space-efficiency.
Minimax Expectiminimax Negamax Pruning (algorithm)
Branch and
bound Combinatorial optimization Prin****l...
- Aumann's
agreement theorem Folk
theorem Minimax theorem Nash's
theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem...
-
intelligence algorithms able to
strongly solve Connect Four are
minimax or
negamax, with
optimizations that
include alpha-beta pruning, move ordering, and...
-
visible set, a form of
occlusion culling Prin****l
variation search, a
negamax algorithm Prototype Verification System, a
specification language PVS-Studio...
- Aumann's
agreement theorem Folk
theorem Minimax theorem Nash's
theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem...
-
search (sometimes
equated with the
practically identical NegaScout) is a
negamax algorithm that can be
faster than alpha–beta pruning. Like alpha–beta pruning...
-
performing a full
search on each child, etc.
Minimax Alpha–beta
pruning Negamax Expected value Russell,
Stuart Jonathan; Norvig, Peter; Davis,
Ernest (2010)...
- Aumann's
agreement theorem Folk
theorem Minimax theorem Nash's
theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem...
