Skip to main content

Job-Level Proof-Number Search for Connect6

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6515))

Abstract

This paper proposes a new approach for proof number (PN) search, named job-level PN (JL-PN) search, where each search tree node is evaluated or expanded by a heavy-weight job, which takes normally over tens of seconds. Such JL-PN search is well suited for parallel processing, since these jobs are allowed to be performed by remote processors independently. This paper applies JL-PN search to solving automatically several Connect6 positions including openings on desktop grids. For some of these openings, so far no human expert had been able to find a winning strategy. Our experiments also show that the speedups for solving the test positions are roughly linear, fluctuating from sublinear to superlinear. Hence, JL-PN search appears to be a quite promising approach to solving games.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allis, L.V.: Searching for solutions in games and artificial intelligence, Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands (1994)

    Google Scholar 

  2. Allis, L.V., van den Herik, H.J., Huntjens, M.P.H.: Go-Moku Solved by New Search Techniques. Computational Intelligence 12, 7–23 (1996)

    Article  Google Scholar 

  3. Allis, L.V., van der Meulen, M., van den Herik, H.J.: Proof-number search. Artificial Intelligence 66(1), 91–124 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Anderson, D.P.: Bonic: A system for public-resource computing and storage. In: Proceedings of the Fifth IEEE/ACM International Workshop on Grid Computing (GRID 2004), pp. 4–10. IEEE CS Press, Pittsburgh (2004)

    Chapter  Google Scholar 

  5. Breuker, D.M., Uiterwijk, J., van den Herik, H.J.: The PN2-search algorithm. In: van den Herik, H.J., Monien, B. (eds.) Advances in Computer Games 9, IKAT, Universiteit Maastricht, Maastricht, The Netherlands, pp. 115–132 (2001)

    Google Scholar 

  6. 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)

    Chapter  Google Scholar 

  7. Fedak, G., Germain, C., Neri, V., Cappello, F.: Xtremweb: A generic global computing system. In: Proceedings of the 1st IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID 2001): Workshop on Global Computing on Personal Devices, pp. 582–587. IEEE CS Press, Brisbane (2001)

    Chapter  Google Scholar 

  8. van den Herik, H.J., Winands, M.H.M.: Proof-Number Search and its Variants. In: Oppositional Concepts in Computational Intelligence, pp. 91–118 (2008)

    Google Scholar 

  9. van den Herik, H.J., Uiterwijk, J.W.H.M., Rijswijck, J.V.: Games solved: Now and in the future. Artificial Intelligence 134, 277–311 (2002)

    Article  MATH  Google Scholar 

  10. Kishimoto, A., Kotani, Y.: Parallel AND/OR tree search based on proof and disproof numbers. In: 5th Games Programming Workshop. IPSJ Symposium Series, vol. 99(14), pp. 24–30 (1999)

    Google Scholar 

  11. Kishimoto, A., Müller, M.: Search versus Knowledge for Solving Life and Death Problems in Go. In: Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1374–1379 (2005)

    Google Scholar 

  12. Lin, P.-H., Wu, I.-C.: NCTU6 Wins Man-Machine Connect6 Championship 2009. ICGA Journal 32(4), 230–232 (2009)

    Article  Google Scholar 

  13. Manohararajah, V.: Parallel alpha-beta search on shared memory multiprocessors. Master’s thesis, Graduate Department of Electrical and Computer Engineering, University of Toronto, Canada (2001)

    Google Scholar 

  14. Nagai, A.: Df-pn Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, University of Tokyo, Japan (2002)

    Google Scholar 

  15. Pawlewicz, J., Lew, Ł.: Improving depth-first PN-search: 1 + ε trick. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 160–171. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  16. Rao, V.N., Kumar, V.: Superlinear Speedup in State-space Search. In: Kumar, S., Nori, K.V. (eds.) FSTTCS 1988. LNCS, vol. 338, pp. 161–174. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  17. 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)

    Chapter  Google Scholar 

  18. Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 5844(317), 1518–1552 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  19. Seo, M., Iida, H., Uiterwijk, J.: The PN*-search algorithm: Application to Tsumeshogi. Artificial Intelligence 129(1-2), 253–277 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  20. SETI@home Project, http://setiathome.ssl.berkeley.edu

  21. Taiwan Connect6 Association, Connect6 homepage, http://www.connect6.org/

  22. Thomsen, T.: Lambda-search in game trees - with application to Go. ICGA Journal 23(4), 203–217 (2000)

    Google Scholar 

  23. Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: PDS-PN: A New Proof-Number Search Algorithm. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 61–74. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  24. Wu, I-C., Hsu, S.-C., Yen, S.-J., Lin, S.-S., Kao, K.-Y., Chen, J.-C., Huang, K.-C., Chang, H.-Y., Chung, Y.-C.: A Volunteer Computing System for Computer Games and its Applications, an integrated project proposal submitted to National Science Council, Taiwan (2010)

    Google Scholar 

  25. Wu, I.-C., Chen, C.-P., Lin, P.-H., Huang, K.-C., Chen, L.-P., Sun, D.-J., Chan, Y.-C., Tsou, H.-Y.: A Volunteer-Computing-Based Grid Environment for Connect6 Applications. In: The 12th IEEE International Conference on Computational Science and Engineering (CSE 2009), Vancouver, Canada, August 29-31 (2009)

    Google Scholar 

  26. Wu, I.-C., Lin, P.-H.: NCTU6-Lite Wins Connect6 Tournament. ICGA Journal 31(4), 240–243 (2008)

    Google Scholar 

  27. Wu, I.-C., Lin, P.-H.: Relevance-Zone-Oriented Proof Search for Connect6. The IEEE Transactions on Computational Intelligence and AI in Games (to appear, 2010)

    Google Scholar 

  28. Wu, I.-C., Huang, D.-Y., Chang, H.-C.: Connect6. ICGA Journal 28(4), 234–242 (2006)

    Google Scholar 

  29. Wu, I.-C., Huang, D.-Y.: A New Family of k-in-a-Row Games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-s., Donkers, H.H.L.M(J.) (eds.) CG 2005. LNCS, vol. 4250, pp. 180–194. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  30. Wu, I.-C., Yen, S.-J.: NCTU6 Wins Connect6 Tournament. ICGA Journal 29(3), 157–158 (2006)

    Google Scholar 

  31. Wu, I.-C., et al.: Benchmark for Connect6, http://www.connect6.org/articles/JL-PNS/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, IC., Lin, HH., Lin, PH., Sun, DJ., Chan, YC., Chen, BT. (2011). Job-Level Proof-Number Search for Connect6. In: van den Herik, H.J., Iida, H., Plaat, A. (eds) Computers and Games. CG 2010. Lecture Notes in Computer Science, vol 6515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17928-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17928-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17927-3

  • Online ISBN: 978-3-642-17928-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics