Decision Quality As a Function of Search Depth on Game Trees

DOI10.1145/2157.322400zbMath0627.68076OpenAlexW2126701363MaRDI QIDQ3763615

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 playingpathologyminimax approximationgraph and tree search strategies

Mathematics Subject Classification ID

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

Related Items (10)

Conspiracy numbers for min-max search ⋮ Benefits of using multivalued functions for minimaxing ⋮ Independent-valued minimax: Pathological or beneficial? ⋮ The last player theorem ⋮ An investigation of the causes of pathology in games ⋮ On look-ahead and pathology in decision tree learning ⋮ Is real-valued minimax pathological? ⋮ 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

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