Georg Mogk

Completeness and Diversity in Depth-First Proof-Number Search with Applications to Retrosynthesis

We revisit Depth-First Proof-Number Search (DFPN), a well-known algorithm for solving two-player games. First, we consider the completeness property of the algorithm and its variants, i.e., whether they always find a winning strategy when there exists one. While it is known that the standard version…