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 αβ 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Campbell, M., Hoane, J., Hsu, F.: Deep Blue. Artificial Intelligence 134, 57–83 (2002)
Nalimov, E., Haworth, G., Heinz, E.: Space-efficient indexing of chess endgame tables. International Computer Games Association Journal 23, 148–162 (2000)
Allis, V., van der Meulen, M., van den Herik, J.: Proof-number search. Artificial Intelligence 66, 91–123 (1994)
Breuker, D., Allis, V., van den Herik, J.: How to mate: Applying proof-number search. In: van den Herik, J., Herschberg, I., Uiterwijk, J. (eds.) Advances in Computer Chess 7, University of Limburg, pp. 251–272 (1994)
Seo, M., Iida, H., Uiterwijk, J.: The PN*-search algorithm: Application to Tsumeshogi. Artificial Intelligence 129, 253–277 (2001)
Sackson, S.: A Gamut of Games. Random House (1969)
Winands, M.: Analysis and implementation of Lines of Action. Master’s thesis, Department of Computer Science, Universiteit Maastricht (2000)
Winands, M., Uiterwijk, J., van den Herik, J.: The quad heuristic in Lines of Action. International Computer Games Association Journal 24, 3–15 (2001)
Allis, V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Department of Computer Science, University of Limburg (1994)
Winands, M., Uiterwijk, J.: PN, PN2 and PN* in Lines of Action. Technical report, Department of Computer Science, Universiteit Maastricht (2001)
Breuker, D.: Memory versus Search in Games. PhD thesis, Department of Computer Science, Universiteit Maastricht (1998)
Breuker, D., Uiterwijk, J., van den Herik, J.: The PN2-search algorithm. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, pp. 115–132 (2001)
Berkey, D.: Calculus. Saunders College Publishing (1988)
Nagai, A.: A new AND/OR tree search algorithm using proof number and disproof number. In: Proceedings of Complex Games Lab Workshop, ETL, Tsukuba, Japan, pp. 40–45 (1998)
Nagai, A.: A new depth-first-search algorithm for AND/OR trees. Master’s thesis, The University of Tokyo (1999)
Breuker, D., Uiterwijk, J., van den Herik, J.: Replacement schemes and two-level tables. International Computer Chess Association Journal 19, 175–180 (1996)
Breuker, D., van den Herik, J., Uiterwijk, J., Allis, V.: A solution to the GHI problem for best-first search. Theoretical Computer Science 252, 121–149 (2001)
Kocsis, L., Uiterwijk, J., van den Herik, J.: Move ordering using neural networks. In: Monostori, L., Váncza, J., Ali, M. (eds.) IEA/AIE 2001. LNCS (LNAI), vol. 2070, pp. 45–50. Springer, Heidelberg (2001)
Akl, S., Newborn, M.: The principal continuation and the killer heuristic. In: 1977 ACM Annual Conference Proceedings, pp. 466–473. ACM, New York (1977)
Sakuta, M., Iida, H.: The performance of PN*, PDS and PN search on 6×6 Othello and Tsume-shogi. In: van den Herik, J., Monien, B. (eds.) Advances in Computer Games 9, Universiteit Maastricht, pp. 203–222 (2001)
Nagai, A.: DF-PN Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, The University of Tokyo (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, J. (2003). PDS-PN: A New Proof-Number Search Algorithm. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds) Computers and Games. CG 2002. Lecture Notes in Computer Science, vol 2883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40031-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-40031-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20545-6
Online ISBN: 978-3-540-40031-8
eBook Packages: Springer Book Archive