Evaluation-Function Based Proof-Number Search

Mark H. M. Winands; Maarten P. D. Schadd

doi:10.1007/978-3-642-17928-0_3

Evaluation-Function Based Proof-Number Search

Mark H. M. Winands^*, Maarten P. D. Schadd

^*Corresponding author for this work

Networks and Strategic Optimization

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

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.

Original language	English
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
Publisher	Springer
Pages	23-35
Number of pages	13
ISBN (Print)	978-3-642-17928-0
DOIs	https://doi.org/10.1007/978-3-642-17928-0_3
Publication status	Published - 2011

Publication series

Series	Lecture Notes in Computer Science
Volume	6515

Access to Document

10.1007/978-3-642-17928-0_3

http://dx.doi.org/10.1007/978-3-642-17928-0_3

Cite this

Winands, Mark H. M. ; Schadd, Maarten P. D. / Evaluation-Function Based Proof-Number Search. Computers and Games: 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers. editor / H. Jaap van den Herik ; Hiroyuki Iida ; Aske Plaat. Berlin, Heidelberg : Springer, 2011. pp. 23-35 (Lecture Notes in Computer Science, Vol. 6515).

@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",

}

Winands, MHM & Schadd, MPD 2011, Evaluation-Function Based Proof-Number Search. in HJ van den Herik, H Iida & A Plaat (eds), Computers and Games: 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers. Springer, Berlin, Heidelberg, Lecture Notes in Computer Science, vol. 6515, pp. 23-35. https://doi.org/10.1007/978-3-642-17928-0_3

Evaluation-Function Based Proof-Number Search. / Winands, Mark H. M.; Schadd, Maarten P. D.
Computers and Games: 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers. ed. / H. Jaap van den Herik; Hiroyuki Iida; Aske Plaat. Berlin, Heidelberg: Springer, 2011. p. 23-35 (Lecture Notes in Computer Science, Vol. 6515).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic

TY - CHAP

T1 - Evaluation-Function Based Proof-Number Search

AU - Winands, Mark H. M.

AU - Schadd, Maarten P. D.

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-17928-0_3

DO - 10.1007/978-3-642-17928-0_3

M3 - Chapter

SN - 978-3-642-17928-0

T3 - Lecture Notes in Computer Science

SP - 23

EP - 35

BT - Computers and Games

A2 - van den Herik, H. Jaap

A2 - Iida, Hiroyuki

A2 - Plaat, Aske

PB - Springer

CY - Berlin, Heidelberg

ER -

Winands MHM, Schadd MPD. Evaluation-Function Based Proof-Number Search. In van den Herik HJ, Iida H, Plaat A, editors, Computers and Games: 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers. Berlin, Heidelberg: Springer. 2011. p. 23-35. (Lecture Notes in Computer Science, Vol. 6515). doi: 10.1007/978-3-642-17928-0_3