Conspiracy numbers for min-max search

DOI10.1016/0004-3702(88)90019-7zbMath0643.90109MaRDI QIDQ1102218

David Allen McAllester

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0004-3702(88)90019-7

zbMATH Keywords

conspiracy number; incomplete search trees; min-max game trees

Mathematics Subject Classification ID

05C05: Trees

91A99: Game theory

90B40: Search theory

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Two-agent IDA*, Proof-Number Search and Its Variants, The \(PN^{*}\)-search algorithm: Application to tsume-shogi, Improving heuristic mini-max search by supervised learning, Games solved: Now and in the future, Computer Go: An AI oriented survey, Error propagation in game trees, A Bayesian approach to relevance in game playing, Principles of metareasoning, Proof-number search, An analysis of the conspiracy numbers algorithm, Unifying single-agent and two-player search, Games, computers, and artificial intelligence, Error analysis in minimax trees, An effective two-level proof-number search algorithm, Weak Proof-Number Search

Cites Work

• A minimax algorithm better than alpha-beta?
• An analysis of alpha-beta pruning
• A minimax algorithm better than alpha-beta? Yes and no
• Pathology on game trees revisited, and an alternative to minimaxing
• Decision Quality As a Function of Search Depth on Game Trees