An Effective Two-Level Proof-Number Search Algorithm

M.H.M. Winands; J.W.H.M. Uiterwijk; H.J. van den Herik

doi:10.1016/j.tcs.2002.10.006

An Effective Two-Level Proof-Number Search Algorithm

M.H.M. Winands^*, J.W.H.M. Uiterwijk, H.J. van den Herik

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

The paper presents a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first FIN search. Hence, PDS-PN selectively exploits the power of both PN2 and PDS. Experiments in the domain of Lines of Action are performed. They show that within an acceptable time frame PDS-PN is more effective for really hard endgame positions than alphabeta and any other PN-search algorithm.

Original language	English
Pages (from-to)	511-525
Journal	Theoretical Computer Science
Volume	313
DOIs	https://doi.org/10.1016/j.tcs.2002.10.006
Publication status	Published - 1 Jan 2004

Access to Document

10.1016/j.tcs.2002.10.006

Cite this

@article{f0ea4d98ecac496599a9f40fc32632cd,

title = "An Effective Two-Level Proof-Number Search Algorithm",

abstract = "The paper presents a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first FIN search. Hence, PDS-PN selectively exploits the power of both PN2 and PDS. Experiments in the domain of Lines of Action are performed. They show that within an acceptable time frame PDS-PN is more effective for really hard endgame positions than alphabeta and any other PN-search algorithm. ",

author = "M.H.M. Winands and J.W.H.M. Uiterwijk and \{van den Herik\}, H.J.",

year = "2004",

month = jan,

day = "1",

doi = "10.1016/j.tcs.2002.10.006",

language = "English",

volume = "313",

pages = "511--525",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - An Effective Two-Level Proof-Number Search Algorithm

AU - Winands, M.H.M.

AU - Uiterwijk, J.W.H.M.

AU - van den Herik, H.J.

PY - 2004/1/1

Y1 - 2004/1/1

N2 - The paper presents a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first FIN search. Hence, PDS-PN selectively exploits the power of both PN2 and PDS. Experiments in the domain of Lines of Action are performed. They show that within an acceptable time frame PDS-PN is more effective for really hard endgame positions than alphabeta and any other PN-search algorithm.

AB - The paper presents a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first FIN search. Hence, PDS-PN selectively exploits the power of both PN2 and PDS. Experiments in the domain of Lines of Action are performed. They show that within an acceptable time frame PDS-PN is more effective for really hard endgame positions than alphabeta and any other PN-search algorithm.

U2 - 10.1016/j.tcs.2002.10.006

DO - 10.1016/j.tcs.2002.10.006

M3 - Article

SN - 0304-3975

VL - 313

SP - 511

EP - 525

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

An Effective Two-Level Proof-Number Search Algorithm

Abstract

Access to Document

Fingerprint

Cite this