Conspiracy numbers for min-max search

DOI10.1016/0004-3702(88)90019-7zbMath0643.90109OpenAlexW1992249923MaRDI 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 numberincomplete search treesmin-max game trees

Mathematics Subject Classification ID

Trees (05C05) Game theory (91A99) Search theory (90B40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (19)

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

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

This page was built for publication: Conspiracy numbers for min-max search