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

isbn = "978-3-540-20545-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Berlin, Heidelberg",

pages = "61--74",

editor = "J. Schaeffer and M. M{\"u}ller and Y. Bj{\"o}rnsson",

booktitle = "Computers and Games. CG 2002",

address = "Germany",

}