The last player theorem

DOI10.1016/0004-3702(82)90010-8MaRDI QIDQ1158067zbMATH OpenOpenAlexFDO

Authors 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

decision analysisartificial intelligencedecision-makinggame treesbiasinglast player theorem

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3612275 (Why is no real title available?)
• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• Decision Quality As a Function of Search Depth on Game Trees
• On the branching factor of the alpha-beta pruning algorithm

Cited in

(9)

• The effect of mobility on minimaxing of game trees with random leaf values
• Asymptotic properties of level-regular decision trees with randomly evaluated leaves
• On game graph structure and its influence on pathology
• Independent-valued minimax: Pathological or beneficial?
• An investigation of the causes of pathology in games
• Pathology on game trees revisited, and an alternative to minimaxing
• The multi-player version of minimax displays game-tree pathology
• Best-first minimax search
• A theoretical and empirical investigation of search in imperfect information games

This page was built for publication: The last player theorem

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