An effective two-level proof-number search algorithm

DOI10.1016/J.TCS.2002.10.006zbMath1070.68030OpenAlexW2086452649MaRDI QIDQ1885011

H. Jaap van den Herik, Mark H. M. Winands, Jos W. H. M. Uiterwijk

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2002.10.006

zbMATH Keywords

PDSLines of ActionProof-number searchTwo-level search

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial games (91A46) Experimental studies (91A90)

Related Items (1)

Proof-Number Search and Its Variants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Best-first fixed-depth minimax algorithms
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• Deep Blue

This page was built for publication: An effective two-level proof-number search algorithm