Decision Quality As a Function of Search Depth on Game Trees

DOI10.1145/2157.322400MaRDI QIDQ3763615zbMATH OpenOpenAlexFDO

Authors Dana S. Nau

Publication date 1983

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2157.322400

zbMATH Keywords

decision analysisgame playinggraph and tree search strategiesminimax approximationpathology

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory for games (91A35)

Cited in

(10)

• Conspiracy numbers for min-max search
• Benefits of using multivalued functions for minimaxing
• The last player theorem
• An investigation of the causes of pathology in games
• The multi-player version of minimax displays game-tree pathology
• Pathology on game trees revisited, and an alternative to minimaxing
• Is real-valued minimax pathological?
• Independent-valued minimax: Pathological or beneficial?
• On look-ahead and pathology in decision tree learning
• The effect of mobility on minimaxing of game trees with random leaf values

This page was built for publication: Decision Quality As a Function of Search Depth on Game Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3763615)