Proof-Number Search and Its Variants

DOI10.1007/978-3-540-70829-2_6zbMath1181.68127OpenAlexW1567614956MaRDI QIDQ5302475

H. Jaap van den Herik, Mark H. M. Winands

Publication date: 7 January 2009

Published in: Oppositional Concepts in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70829-2_6

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cites Work

• Conspiracy numbers for min-max search
• An analysis of alpha-beta pruning
• Proof-number search
• A solution to the GHI problem for best-first search
• An effective two-level proof-number search algorithm
• Best-first fixed-depth minimax algorithms
• Checkers Is Solved
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• Deep Blue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof-Number Search and Its Variants