Skip to main content
SpringerLink
Log in

Developments on Product Propagation

  • Conference paper
  • First Online:
Computers and Games (CG 2013)

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

Included in the following conference series:

Abstract

Product Propagation (pp) is an algorithm to backup probabilistic evaluations for abstract two-player games. It was shown that pp could solve Go problems as efficiently as Proof Number Search (pns). In this paper, we exhibit three domains where, for generic non-optimized versions, pp performs better (see the nuances in the paper) than previously known algorithms for solving games. The compared approaches include alpha-beta search, pns, and Monte-Carlo Tree Search. We also extend pp to deal with its memory consumption and to improve its solving time.

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

Access this chapter

Log in via an institution
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 EPUB and 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

Institutional subscriptions

Notes

  1. 1.

    Akihiro Kishimoto, personal communication.

  2. 2.

    Some results can also be found on http://www.personeel.unimaas.nl/uiterwijk/Domineering_results.html.

  3. 3.

    http://www.birs.ca/events/2011/5-day-workshops/11w5073

References

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

    Article  MATH  Google Scholar 

  2. Baum, E.B., Smith, W.D.: Best play for imperfect players and game tree search. Technical report, NEC Research Institute (1993)

    Google Scholar 

  3. Baum, E.B., Smith, W.D.: A Bayesian approach to relevance in game playing. Artif. Intell. 97(1–2), 195–242 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Breuker, D.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Solving 8\(\times \)8 domineering. Theor. Comput. Sci. 230(1–2), 195–206 (2000)

    Article  MATH  Google Scholar 

  5. Breuker, D.M.: Memory versus search in games. Ph.D. thesis, Universiteit Maastricht (1998)

    Google Scholar 

  6. Browne, C., Powley, E., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012)

    Article  Google Scholar 

  7. Cazenave, T., Saffidine, A.: Score bounded Monte-Carlo tree search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 93–104. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Chou, C.-W., Teytaud, O., Yen, S.-J.: Revisiting Monte-Carlo tree search on a normal form game: NoGo. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 73–82. Springer, Heidelberg (2011)

    Google Scholar 

  9. Ewalds, T.: Playing and solving Havannah. Master’s thesis, University of Alberta (2012)

    Google Scholar 

  10. Hauk, T., Buro, M., Schaeffer, J.: Rediscovering *-Minimax search. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 35–50. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  11. Horacek, H.: Towards understanding conceptual differences between minimaxing and product-propagation. In: 14th European Conference on Artificial Intelligence (ECAI), pp. 604–608 (2000)

    Google Scholar 

  12. Horacek, H., Kaindl, H.: An analysis of decision quality of minimaxing vs. product propagation. In: Proceedings of the 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC’09, Piscataway, NJ, USA, pp. 2568–2574. IEEE Press (2009)

    Google Scholar 

  13. Kishimoto, A., Müller, M.: A solution to the GHI problem for depth-first proof-number search. Inf. Sci. 175(4), 296–314 (2005)

    Article  Google Scholar 

  14. Kishimoto, A., Winands, M.H.M., Müller, M., Saito, J.-T.: Game-tree search using proof numbers: the first twenty years. ICGA J. 35(3), 131–156 (2012)

    Google Scholar 

  15. Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)

    Google Scholar 

  16. Lachmann, M., Moore, C., Rapaport, I.: Who Wins Domineering on Rectangular Boards, vol. 42. Cambridge University Press, Cambridge (2002)

    Google Scholar 

  17. Lorentz, R.J.: Amazons discover Monte-Carlo. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 13–24. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Müller, M.: Proof-set search. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 88–107. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  19. Nijssen, J.A.M., Winands, M.H.M.: An overview of search techniques in multi-player games. In: Computer Games Workshop at ECAI 2012, pp. 50–61 (2012)

    Google Scholar 

  20. Pearl, J.: On the nature of pathology in game searching. Artif. Intell. 20(4), 427–453 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  21. Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach, 3rd edn. Pearson Education, Upper Saddle River (2010)

    Google Scholar 

  22. Saffidine, A., Cazenave, T.: Multiple-outcome proof number search. In: De Raedt, L., Bessiere, C., Dubois, D., Doherty, P., Frasconi, P., Heintz, F., Lucas, P. (eds.) 20th European Conference on Artificial Intelligence (ECAI). Frontiers in Artificial Intelligence and Applications, Montpellier, France, vol. 242, pp. 708–713. IOS Press, August 2012

    Google Scholar 

  23. Saffidine, A., Cazenave, T., Méhat, J.: UCD: Upper Confidence bound for rooted Directed acyclic graphs. Knowl. Based Syst. 34, 26–33 (2011)

    Article  Google Scholar 

  24. Saffidine, A., Finnsson, H., Buro, M.: Alpha-beta pruning for games with simultaneous moves. In: Hoffmann,J., Selman, B. (eds.) 26th AAAI Conference on Artificial Intelligence (AAAI), Toronto, Canada, pp. 556–562. AAAI Press, July 2012

    Google Scholar 

  25. Schadd, M.P.D., Winands, M.H.M.: Best reply search for multiplayer games. IEEE Trans. Comput. Intell. AI Games 3(1), 57–66 (2011)

    Article  Google Scholar 

  26. Schensted, C., Titus, C.: Mudcrack Y & Poly-Y. Neo Press (1975)

    Google Scholar 

  27. Schijf, M., Victor Allis, L., Uiterwijk, J.W.H.M.: Proof-number search and transpositions. ICCA J. 17(2), 63–74 (1994)

    Google Scholar 

  28. Slagle, J.R., Bursky, P.: Experiments with a multipurpose, theorem-proving heuristic program. J. ACM 15(1), 85–99 (1968)

    Article  MATH  Google Scholar 

  29. Stern, D., Herbrich, R., Graepel, T.: Learning to solve game trees. In: 24th International Conference on Machine Learning, ICML ’07, pp. 839–846. ACM, New York (2007)

    Google Scholar 

  30. Sturtevant, N.R.: A comparison of algorithms for multi-player games. In: Computer and Games (2002)

    Google Scholar 

  31. van den Herik, H.J., Winands, M.H.M.: Proof-number search and its variants. In: Tizhoosh, H.R., Ventresca, M. (eds.) Oppos. Concepts in Comp. Intel., SCI, vol. 155, pp. 91–118. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  32. van Rijswijck, J.: Search and evaluation in Hex. Technical report, University of Alberta (2002)

    Google Scholar 

  33. Winands, M.H.M., Björnsson, Y., Saito, J.-T.: Monte Carlo tree search in lines of action. IEEE Trans. Comput. Intell. AI Games 2(4), 239–250 (2010)

    Article  Google Scholar 

  34. Winands, M.H.M., Björnsson, Y., Saito, J.-T.: Monte-Carlo tree search solver. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 25–36. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Paris, France

    Abdallah Saffidine & Tristan Cazenave

Authors
  1. Abdallah Saffidine
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tristan Cazenave
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdallah Saffidine .

Editor information

Editors and Affiliations

  1. Tilburg University, Tilburg, The Netherlands

    H. Jaap van den Herik

  2. JAIST, Ishikawa, Japan

    Hiroyuki Iida

  3. Tilburg University, Tilburg, The Netherlands

    Aske Plaat

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Saffidine, A., Cazenave, T. (2014). Developments on Product Propagation. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09165-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09164-8

  • Online ISBN: 978-3-319-09165-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation