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.
|Title of host publication||Computers and Games|
|Subtitle of host publication||7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers|
|Editors||H. Jaap van den Herik, Hiroyuki Iida, Aske Plaat|
|Place of Publication||Berlin, Heidelberg|
|Number of pages||13|
|Publication status||Published - 2011|
|Series||Lecture Notes in Computer Science|