The last player theorem

DOI10.1016/0004-3702(82)90010-8zbMath0471.90003OpenAlexW1980327423MaRDI QIDQ1158067

Dana S. Nau

Publication date: 1982

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

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

zbMATH Keywords

artificial intelligencedecision analysisdecision-makinggame treesbiasinglast player theorem

Mathematics Subject Classification ID

Trees (05C05) Decision theory (91B06) 2-person games (91A05) Applications of game theory (91A80) Artificial intelligence (68T99)

Related Items (9)

Asymptotic properties of level-regular decision trees with randomly evaluated leaves ⋮ Best-first minimax search ⋮ Independent-valued minimax: Pathological or beneficial? ⋮ An investigation of the causes of pathology in 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 ⋮ A theoretical and empirical investigation of search in imperfect information games ⋮ The multi-player version of minimax displays game-tree pathology

Cites Work

• Unnamed Item
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• On the branching factor of the alpha-beta pruning algorithm
• Decision Quality As a Function of Search Depth on Game Trees

This page was built for publication: The last player theorem