Abstract
Various efficient game problem solvers are based on PN-Search. Especially depth-first versions of PN-Search like DF-PN or PDS – contrary to other known techniques – are able to solve really hard problems. However, the performance of DF-PN and PDS decreases drastically when the search space significantly exceeds the available memory. A straightforward enhancement trick to overcome this problem is presented. Experiments on Atari Go and Lines of Action show great practical value of the proposed enhancement.
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
Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-Number Search. Artificial Intelligence 66, 91–124 (1994)
Breuker, D.M., Uiterwijk, J.W.H.M., van der Herik, H.J.: Replacement Schemes and Two-Level Tables. ICCA J. 19(3), 175–180 (1996)
Breuker, D.M., Uiterwijk, J.W.H.M., van der Herik, H.J.: The PN2-Search Algorithm. In: van den Herik, H.J., Monien, B. (eds.) 9th Advances in Computer Games (ACG9), pp. 115–132. Department of Computer Science, Universiteit Maastricht, Maastricht, The Netherlands (2001)
Kishimoto, A., Müller, M.: Search Versus Knowledge for Solving Life and Death Problems in Go. In: Twentieth National Conference on Artificial Intelligence (AAAI-05), pp. 1374–1379 (2005)
Nagai, A.: A New AND/OR Tree Search Algorithm using Proof Number and Disproof Number. In: Proceeding of Complex Games Lab Workshop, pp. 40–45, Tsukuba, ETL (November 1998)
Nagai, A.: Df–pn Algorithm for Searching AND/OR Trees and its Applications. Ph.d. thesis, The University of Tokyo, Tokyo, Japan (2002)
Seo, M., Iida, H., Uiterwijk, J.W.H.M.: The PN*–Search Algorithm: Application to Tsume-Shogi. Artificial Intelligence 129(1–2), 253–277 (2001)
Winands, M.H.M.: Mark’s LOA Homepage (2007), http://www.cs.unimaas.nl/m.winands/loa/
Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: An Effective Two-Level Proof-Number Search Algorithm. Theoretical Computer Science 313(3), 511–525 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pawlewicz, J., Lew, Ł. (2007). Improving Depth-First PN-Search: 1 + ε Trick. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.(. (eds) Computers and Games. CG 2006. Lecture Notes in Computer Science, vol 4630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75538-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-75538-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75537-1
Online ISBN: 978-3-540-75538-8
eBook Packages: Computer ScienceComputer Science (R0)