An incremental negamax algorithm

DOI10.1016/0004-3702(90)90070-GzbMath0718.90104MaRDI QIDQ2639785

Ingo Althöfer

Publication date: 1990

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

minimax algorithmgame treeserroneous evaluation functionsincremental negamax algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) Stochastic games, stochastic differential games (91A15) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• Nim games with arbitrary periodic moving orders
• Searching for an optimal path in a tree with random costs
• Pathology on game trees revisited, and an alternative to minimaxing
• On the nature of pathology in game searching

This page was built for publication: An incremental negamax algorithm