Pathology on game trees revisited, and an alternative to minimaxing

DOI10.1016/S0004-3702(83)80011-3zbMath0507.68064MaRDI QIDQ1837547

Dana S. Nau

Publication date: 1983

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

zbMATH Keywords

game tree searchprobabilistic decision procedure

Mathematics Subject Classification ID

Searching and sorting (68P10) Search theory (90B40) Artificial intelligence (68T99) Decision theory for games (91A35)

Related Items

Game tree searching by min/max approximation, Asymptotic properties of level-regular decision trees with randomly evaluated leaves, Conspiracy numbers for min-max search, An incremental negamax algorithm, A Bayesian approach to relevance in game playing, Benefits of using multivalued functions for minimaxing, When is it better not to look ahead?, Independent-valued minimax: Pathological or beneficial?, Is real-valued minimax pathological?, Limited lookahead in imperfect-information games, On game graph structure and its influence on pathology, Partial order bounding: A new approach to evaluation in game tree search, Two-agent IDA*, From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future, 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, Bias and pathology in minimax search

Cites Work

• Unnamed Item
• Unnamed Item
• A minimax algorithm better than alpha-beta?
• Asymptotic properties of minimax trees and game-searching procedures
• The last player theorem
• An investigation of the causes of pathology in games
• An analysis of alpha-beta pruning
• The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores
• On the branching factor of the alpha-beta pruning algorithm
• On the nature of pathology in game searching
• Decision Quality As a Function of Search Depth on Game Trees