@inbook{c0c27c19b18c48459fa36bd1ea6c8edc,
title = "Evaluation-Function Based Proof-Number Search",
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.",
author = "Winands, {Mark H. M.} and Schadd, {Maarten P. D.}",
year = "2011",
doi = "10.1007/978-3-642-17928-0_3",
language = "English",
isbn = "978-3-642-17928-0",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "23--35",
editor = "{van den Herik}, {H. Jaap} and Hiroyuki Iida and Aske Plaat",
booktitle = "Computers and Games",
address = "United States",
}