Move-Pruning Techniques for Monte-Carlo Go

  • Bruno Bouzy
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4250)


Progressive Pruning (PP) is employed in the Monte-Carlo Go-playing program Indigo. For each candidate move, PP launches random games starting with this move. The goal of PP is: (1) to gather statistics on moves, and (2) to prune moves statistically inferior to the best one [7]. This papers yields two new pruning techniques: Miai Pruning (MP) and Set Pruning (SP). In MP the second move of the random games is selected at random among the set of candidate moves. SP consists in gathering statistics about two sets of moves, good and bad, and it prunes the latter when statistically inferior to the former. Both enhancements clearly speed up the process of selecting a move on 9×9 boards, and MP improves slightly the playing level. Scaling up MP to 19×19 boards results in a 30% speed-up enhancement and in a four-point improvement on average.


Computer Game Relative Speed Good Move Pruning Technique Candidate Move 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abramson, B.: Expected-outcome: a General Model of Static Evaluation. IEEE Transactions on PAMI 12, 182–193 (1990)Google Scholar
  2. 2.
    Billings, D., Davidson, A., Schaeffer, J., Szafron, D.: The Challenge of Poker. Artificial Intelligence 134, 201–240 (2002)MATHCrossRefGoogle Scholar
  3. 3.
    Bouzy, B.: Associating Domain-Dependent Knowledge and Monte-Carlo Approaches within a Go Program. Information Sciences 175, 247–257 (2005)CrossRefGoogle Scholar
  4. 4.
    Bouzy, B.: Associating Shallow and Selective Global Tree Search with Monte-Carlo for 9×9 Go. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 67–80. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  5. 5.
    Bouzy, B.: Indigo Home Page (2005),
  6. 6.
    Bouzy, B., Cazenave, T.: Computer Go: an AI-oriented Survey. Artificial Intelligence 132, 39–103 (2001)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Bouzy, B., Helmstetter, B.: Monte-Carlo Go Developments. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 159–174. Kluwer Academic Publishers, Boston (2004)Google Scholar
  8. 8.
    Brügmann, B.: Monte-Carlo Go (1993),
  9. 9.
    Coulom, R.: CrazyStone Home Page (2005),
  10. 10.
    Fotland, D.: Go Intellect Wins 19x19 Go Tournament. ICGA Journal 27(3), 169–170 (2004)Google Scholar
  11. 11.
    Lieberum, J.: An Evaluation Function in the Game of Amazons. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 299–308. Kluwer Academic Publishers, Boston (2004)Google Scholar
  12. 12.
    Müller, M.: Computer Go. Artificial Intelligence 134, 145–179 (2002)MATHCrossRefGoogle Scholar
  13. 13.
    Müller, M.: Position Evaluation in Computer Go. ICGA Journal 25(4), 219–228 (2002)Google Scholar
  14. 14.
    Schaeffer, J., van den Herik, H.J.: Games, Computers, and Artificial Intelligence. Artificial Intelligence 134, 1–7 (2002)MATHCrossRefGoogle Scholar
  15. 15.
    Sheppard, B.: World-Championship-Caliber Scrabble. Artificial Intelligence 134, 241–275 (2002)MATHCrossRefGoogle Scholar
  16. 16.
    Sheppard, B.: Effective Control of Selective Simulation. ICGA Journal 27(2), 67–80 (2004)Google Scholar
  17. 17.
    Tesauro, G., Galperin, G.: On-line Policy Improvement using Monte-Carlo Search. In: Advances in Neural Information Processing Systems, pp. 1068–1074. MIT Press, Cambridge (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bruno Bouzy
    • 1
  1. 1.UFR de mathematiques et d’informatiqueUniversité René DescartesParisFrance

Personalised recommendations