Error analysis in minimax trees

DOI10.1016/j.tcs.2002.10.004zbMath1106.91304OpenAlexW2072189563MaRDI QIDQ1885008

Burkhard Monien, Ulf Lorenz

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2002.10.004

zbMATH Keywords

Game treeError propagation

Mathematics Subject Classification ID

Games involving graphs (91A43) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Eigen-distribution on random assignments for game trees ⋮ Independent-valued minimax: Pathological or beneficial? ⋮ On look-ahead and pathology in decision tree learning

Cites Work

• Conspiracy numbers for min-max search
• An analysis of alpha-beta pruning
• On the nature of pathology in game searching
• Unnamed Item
• Unnamed Item

This page was built for publication: Error analysis in minimax trees