A solution to the GHI problem for best-first search

DOI10.1016/S0304-3975(00)00079-7zbMath0954.68055WikidataQ126635197 ScholiaQ126635197MaRDI QIDQ1589511

H. Jaap van den Herik, D. M. Breuker, Jos W. H. M. Uiterwijk, L. Victor Allis

Publication date: 12 December 2000

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

zbMATH Keywords

best-first searchbase-twin algorithmgraph-history interaction problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Related Items

An effective two-level proof-number search algorithm ⋮ Proof-Number Search and Its Variants ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Weak Proof-Number Search ⋮ Games solved: Now and in the future ⋮ BEST PLAY IN FANORONA LEADS TO DRAW ⋮ A solution to the GHI problem for best-first search

Cites Work

• A minimax algorithm better than alpha-beta?
• Proof-number search
• A solution to the GHI problem for best-first search
• Best-first fixed-depth minimax algorithms
• Unnamed Item