Abstract
This article introduces Evaluation-Function based Proof-Number Search (EF-PN) and its second-level variant EF-PN2. It is a framework for initializing the proof and disproof number of a leaf node with the help of a heuristic evaluation function. Experiments in LOA and Surakarta show that compared to PN and PN2, which use mobility to initialize the proof and disproof numbers, EF-PN and EF-PN2 take between 45% to 85% less time for solving positions. Based on these results, we may conclude that EF-PN and EF-PN2 reduce the search space considerably. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Winands, M. H. M., & Schadd, M. P. D. (2011). Evaluation-function based proof-number search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6515 LNCS, pp. 23–35). https://doi.org/10.1007/978-3-642-17928-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
