PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action

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

doi:10.1007/978-3-540-40031-8_5

PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action

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

Research output: Contribution to journal › Conference article in journal › Academic › peer-review

Abstract

The paper introduces a new proof-number (pn) search algorithm, called pds-pn. It is a two-level search, which performs at the first level a depth-first proof-number and disproof-number search (pds), and at the second level a best-first pn search. First, we thoroughly investigate four established algorithms in the domain of lines of action endgame positions: pn, pn2, pds and aß search. It turns out that pn2 and pds are best in solving hard problems when measured by the number of solutions and the solution time. However, each of those two has a practical disadvantage: pn2 is restricted by the working memory, and pds is relatively slow in searching. Then we formulate our new algorithm by selectively using the power of each one: the two-level nature and the depth-first traversal, respectively. Experiments reveal that pds-pn is competitive with pds in terms of speed and with pn2 since it is not restricted in working memory.

Original language	English
Pages (from-to)	61-74
Journal	Lecture Notes in Computer Science
Volume	2883
DOIs	https://doi.org/10.1007/978-3-540-40031-8_5
Publication status	Published - 1 Jan 2003

Access to Document

10.1007/978-3-540-40031-8_5

Cite this

@article{90f9adf7958046f6a96060c1a09042c0,

title = "PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action",

abstract = "The paper introduces a new proof-number (pn) search algorithm, called pds-pn. It is a two-level search, which performs at the first level a depth-first proof-number and disproof-number search (pds), and at the second level a best-first pn search. First, we thoroughly investigate four established algorithms in the domain of lines of action endgame positions: pn, pn2, pds and a{\ss} search. It turns out that pn2 and pds are best in solving hard problems when measured by the number of solutions and the solution time. However, each of those two has a practical disadvantage: pn2 is restricted by the working memory, and pds is relatively slow in searching. Then we formulate our new algorithm by selectively using the power of each one: the two-level nature and the depth-first traversal, respectively. Experiments reveal that pds-pn is competitive with pds in terms of speed and with pn2 since it is not restricted in working memory.",

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

note = "Berlin, Germany ",

year = "2003",

month = jan,

day = "1",

doi = "10.1007/978-3-540-40031-8_5",

language = "English",

volume = "2883",

pages = "61--74",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Nature Switzerland AG",

}

TY - JOUR

T1 - PDS-PN: A New Proof-Number Search Algorithm: Application to Lines of Action

AU - Winands, M.H.M.

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

AU - van den Herik, H.J.

N1 - Berlin, Germany

PY - 2003/1/1

Y1 - 2003/1/1

N2 - The paper introduces a new proof-number (pn) search algorithm, called pds-pn. It is a two-level search, which performs at the first level a depth-first proof-number and disproof-number search (pds), and at the second level a best-first pn search. First, we thoroughly investigate four established algorithms in the domain of lines of action endgame positions: pn, pn2, pds and aß search. It turns out that pn2 and pds are best in solving hard problems when measured by the number of solutions and the solution time. However, each of those two has a practical disadvantage: pn2 is restricted by the working memory, and pds is relatively slow in searching. Then we formulate our new algorithm by selectively using the power of each one: the two-level nature and the depth-first traversal, respectively. Experiments reveal that pds-pn is competitive with pds in terms of speed and with pn2 since it is not restricted in working memory.

AB - The paper introduces a new proof-number (pn) search algorithm, called pds-pn. It is a two-level search, which performs at the first level a depth-first proof-number and disproof-number search (pds), and at the second level a best-first pn search. First, we thoroughly investigate four established algorithms in the domain of lines of action endgame positions: pn, pn2, pds and aß search. It turns out that pn2 and pds are best in solving hard problems when measured by the number of solutions and the solution time. However, each of those two has a practical disadvantage: pn2 is restricted by the working memory, and pds is relatively slow in searching. Then we formulate our new algorithm by selectively using the power of each one: the two-level nature and the depth-first traversal, respectively. Experiments reveal that pds-pn is competitive with pds in terms of speed and with pn2 since it is not restricted in working memory.

U2 - 10.1007/978-3-540-40031-8_5

DO - 10.1007/978-3-540-40031-8_5

M3 - Conference article in journal

VL - 2883

SP - 61

EP - 74

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -