Abstract
The paper concerns an AND/OR-tree search algorithm to solve hard problems. Proof-number search is a well-known powerful search algorithm for that purpose. Its depth-first variants such as PN*, PDS, and df-pn work very well, in particular in the domain of shogi mating problems. However, there are still possible drawbacks. The most prevailing one is the double-counting problem. To handle this problem the paper proposes a new search idea using proof number and branching factor as search estimators. We call the new method Weak Proof-Number Search. The experiments performed in the domain of shogi and Othello show that the proposed search algorithm is potentially more powerful than the original proof-number search or its depth-first variants. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Ueda, T., Hashimoto, T., Hashimoto, J., & Iida, H. (2008). Weak 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. 157–168). https://doi.org/10.1007/978-3-540-87608-3_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
