Bias and pathology in minimax search

DOI10.1016/J.TCS.2005.09.073zbMath1086.68124OpenAlexW2082532828MaRDI QIDQ817803

N. E. Zubov

Publication date: 20 March 2006

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

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

zbMATH Keywords

biasminimax principleminimax pathologyevaluation-function qualityKRK chess endgame

Mathematics Subject Classification ID

Search theory (90B40) Games involving graphs (91A43) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

When is it better not to look ahead? ⋮ Independent-valued minimax: Pathological or beneficial?

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• An investigation of the causes of pathology in games
• Pathology on game trees revisited, and an alternative to minimaxing
• The effect of mobility on minimaxing of game trees with random leaf values

This page was built for publication: Bias and pathology in minimax search