Abstract
breakthrough is a recent race-based board game usually played on a 8×8 board. We describe a method to solve 6×5 boards based on (1) race patterns and (2) an extension of (JLPNS).
Using race patterns is a new domain-specific technique that allows early endgame detection. The patterns we use enable us to prune positions safely and statically as far as 7 moves from the end.
For the purpose of solving Breakthrough we also present an extension of the parallel algorithm (JLPNS), viz. when a PN search is used as the underlying job. In this extension, partial results are regularly sent by the clients to the server.
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.: Searching for Solutions in Games an Artificial Intelligence. Phd thesis, Vrije Universitat Amsterdam, Department of Computer Science, Rijksuniversiteit Limburg (1994)
Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-Number Search. Artificial Intelligence 66(1), 91–124 (1994)
Breuker, D.M.: Memory versus Search in Games. Phd thesis, Universiteit Maastricht (1998)
Brockington, M.: Asynchronous Parallel Game-Tree Search. Phd thesis, University of Alberta (1997)
Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: Proceedings of the Computer Games Workshop, pp. 93–101 (2007)
Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J.: Parallel Monte-Carlo Tree Search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 60–71. Springer, Heidelberg (2008)
Enzenberger, M., Müller, M.: A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 14–20. Springer, Heidelberg (2010)
Feldmann, R., Mysliwietz, P., Monien, B.: Game tree search on a massively parallel system, In: Advances in Computer Chess 7, pp. 203–219 (1993)
Finnsson, H., Björnsson, Y.: Game-tree properties and mcts performance. In: Proceedings of the IJCAI Workshop on General Intelligence in Game-Playing Agents (GIGA 2011), pp. 23–30 (2011)
Handscomb, K.: 8×8 game design competition: The winning game: Breakthrough... and two other favorites. Abstract Games Magazine 7, 8–9 (2001)
Kaneko, T.: Parallel depth first proof number search. In: AAAI (2010)
Kishimoto, A., Schaeffer, J.: Distributed game-tree search using transposition table driven work scheduling. In: Proceedings International Conference on Parallel Processing, pp. 323–330. IEEE (2002)
Kishimoto, A., Kotani, Y.: Parallel and/or tree search based on proof and disproof numbers. In: Game Programming Workshop in Japan, pp. 24–30 (1999)
Nagai, A.: A new and/or tree search algorithm using proof number and disproof number. In: Complex Games Lab Workshop, pp. 40–45. ETL, Tsukuba (1998)
Nagai, A.: Df-pn algorithm for searching AND/OR trees and its applications. Ph.D. thesis (2002)
Saito, J.-T., Winands, M.H.M., van den Herik, H.J.: Randomized Parallel Proof-Number Search. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 75–87. Springer, Heidelberg (2010)
Schadd, M.P.D., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bergsma, M.H.J.: Best Play in Fanorona leads to Draw. New Mathematics and Natural Computation 4(3), 369–387 (2008)
Schaeffer, J., Björnsson, Y., Burch, N., Kishimoto, A., 0003, M.M., Lake, R., Lu, P., Sutphen, S.: Solving checkers. In: IJCAI, pp. 292–297 (2005)
Schaeffer, J., Burch, N., Bjornsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317(5844), 1518 (2007)
Skowronski, P., Björnsson, Y., Winands, M.: Automated Discovery of Search-Extension Features. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 182–194. Springer, Heidelberg (2010)
Wu, I.-C., Lin, H.-H., Lin, P.-H., Sun, D.-J., Chan, Y.-C., Chen, B.-T.: Job-Level Proof-Number Search for Connect6. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 11–22. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Saffidine, A., Jouandeau, N., Cazenave, T. (2012). Solving breakthrough with Race Patterns and Job-Level Proof Number Search. In: van den Herik, H.J., Plaat, A. (eds) Advances in Computer Games. ACG 2011. Lecture Notes in Computer Science, vol 7168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31866-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-31866-5_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31865-8
Online ISBN: 978-3-642-31866-5
eBook Packages: Computer ScienceComputer Science (R0)