On the nature of pathology in game searching

DOI10.1016/0004-3702(83)90004-8zbMath0509.68105OpenAlexW2074942748MaRDI QIDQ1838332

Judea Pearl

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0004-3702(83)90004-8

zbMATH Keywords

minimax distortionprobabilistic game modelsearch-depth pathology

Mathematics Subject Classification ID

Searching and sorting (68P10) Game theory (91A99) Artificial intelligence (68T99)

Related Items

Error analysis in minimax trees, Asymptotic properties of level-regular decision trees with randomly evaluated leaves, An incremental negamax algorithm, Benefits of using multivalued functions for minimaxing, Search in games with incomplete information: a case study using Bridge card play, When is it better not to look ahead?, Independent-valued minimax: Pathological or beneficial?, On look-ahead and pathology in decision tree learning, Is real-valued minimax pathological?, Limited lookahead in imperfect-information games, On game graph structure and its influence on pathology, The effect of mobility on minimaxing of game trees with random leaf values, Pathology on game trees revisited, and an alternative to minimaxing, The multi-player version of minimax displays game-tree pathology, Unifying single-agent and two-player search, A study of decision error in selective game tree search

Cites Work

• Asymptotic properties of minimax trees and game-searching procedures
• An investigation of the causes of pathology in games
• An analysis of alpha-beta pruning
• On the branching factor of the alpha-beta pruning algorithm
• Is real-valued minimax pathological?