Abstract
We propose a new simple calculation technique for proof numbers in Proof-Number Search. Search algorithms based on (dis)proof numbers are known to be effective for solving problems such as tsumego, tsume-shogi, and checkers. Usually, the Proof-Number Search expands child nodes with the smallest (dis)proof number because such nodes are expected to be the easiest to (dis)prove the node. However, when many unpromising child nodes exist, (dis)proof numbers are not always a suitable measure for move ordering because unpromising nodes temporarily increase the (dis)proof numbers. For such cases, we propose the use of only some child nodes (instead of all child nodes) for calculating (dis)proof numbers. We call this technique Dynamic Widening.
We combined Dynamic Widening with the Depth-first Proof-Number Search (df-pn) algorithm and tested its performance on capturing problems of Go on 19×19 boards. Our results show that the approach is more than 30 times faster than normal df-pn when we generate almost all legal moves (about 300 moves on average). The required time for processing remained approximately four times as long as that of df-pn using heuristic pruning (about 20 moves on average), but the correctness of the search result is guaranteed.
This is a preview of subscription content, log in via an institution to check access.
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(1), 91–124 (1994)
Cazenave, T.: Generalized widening. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI 2004), pp. 156–160 (2004)
Kishimoto, A.: Correct and Efficient Search Algorithms in the Presence of Repetitions. PhD thesis, University of Alberta (March 2005)
Kishimoto, A., Müller, M.: Search versus knowledge for solving life and death problems in Go. In: Proc. of Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1374–1379. AAAI Press, Menlo Park (2005)
Korf, R.E.: Linear-space best-first search. Artificial Intelligence 62(1), 41–78 (1993)
Nagai, A.: Df-pn Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, University of Tokyo, Tokyo (2002)
Schaeffer, J.: Game over: Black to play and draw in checkers. ICGA Journal 30(4), 187–197 (2007)
Schaeffer, J., Björnsson, Y., Burch, N., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Solving checkers. In: Proc. of 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 292–297 (2005)
Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317(5844), 1518–1522 (2007)
Thomsen, T.: Madlab website, http://www.t-t.dk/madlab/problems/index.html
Thomsen, T.: Lambda-search in game trees - with application to Go. ICGA Journal 23(4), 203–217 (2000)
Wolf, T.: Forward pruning and other heuristic search techniques in tsume go. Special issue of Information Sciences 122(1), 59–76 (2000)
Yoshizoe, K., Kishimoto, A., Müller, M.: Lambda depth-first proof number search and its application to go. In: Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2404–2409 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yoshizoe, K. (2008). A New Proof-Number Calculation Technique for Proof-Number Search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds) Computers and Games. CG 2008. Lecture Notes in Computer Science, vol 5131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87608-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-87608-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87607-6
Online ISBN: 978-3-540-87608-3
eBook Packages: Computer ScienceComputer Science (R0)