Evaluation-Function Based Proof-Number Search

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

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

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 languageEnglish
Title of host publicationComputers and Games
Subtitle of host publication7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers
EditorsH. Jaap van den Herik, Hiroyuki Iida, Aske Plaat
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages23-35
Number of pages13
ISBN (Print)978-3-642-17928-0
DOIs
Publication statusPublished - 2011

Publication series

SeriesLecture Notes in Computer Science
Volume6515

Cite this

Winands, M. H. M., & Schadd, M. P. D. (2011). Evaluation-Function Based Proof-Number Search. In H. J. 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 (pp. 23-35). Springer. Lecture Notes in Computer Science, Vol.. 6515 https://doi.org/10.1007/978-3-642-17928-0_3