Abstract
Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its theoretical properties remain poorly understood. This paper resolves the question of completeness of df-pn: its ability to solve any finite boolean-valued game tree search problem in principle, given unlimited amounts of time and memory. The main results are that df-pn is complete on finite directed acyclic graphs (DAG) but incomplete on finite directed cyclic graphs (DCG). © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Kishimoto, A., & Müller, M. (2008). About the completeness of depth-first proof-number search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5131 LNCS, pp. 146–156). https://doi.org/10.1007/978-3-540-87608-3_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
