论文信息 - Monte-Carlo approximation of temperature

Monte-Carlo approximation of temperature

Monte-Carlo Go has recently improved to compete with the best Go programs [Coulom 2007; Gelly et al. 2006; Gelly and Silver 2007]. We are interested in the use of Monte-Carlo methods when there are independent games. In such cases it might be interesting to analyze the games independently instead of considering them as a unified game. Section 2 describes related works. Section 3 presents the Monte-Carlo algorithms we have tested. Section 4 details experimental results. Section 5 concludes.

T. Cazenave

[1] E. Berlekamp,et al. Winning Ways for Your Mathematical Plays , 1983 .

[2] Bernd Brügmann Max-Planck. Monte Carlo Go , 1993 .

[3] A. Waters. Winning ways. , 2002, Nursing standard (Royal College of Nursing (Great Britain) : 1987).

[4] Bill Spight. Go Thermography: the 4/21/98 Jiang--Rui Endgame , 2002 .

[5] Zhichao Li,et al. Locally Informed Global Search for Sums of Combinatorial Games , 2004, Computers and Games.

[6] Jonathan Schaeffer,et al. Temperature Discovery Search , 2004, AAAI.

[7] Salma A. Ghoneim,et al. Comparative Study of Approximate Strategies for Playing Sum Games Based on Subgame Types , 2006, Computers and Games.

[8] Olivier Teytaud,et al. Modification of UCT with Patterns in Monte-Carlo Go , 2006 .

[9] Rémi Coulom,et al. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search , 2006, Computers and Games.

[10] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.

[11] David Silver,et al. Combining online and offline knowledge in UCT , 2007, ICML '07.

[12] Tristan Cazenave. Goal threats, temperature, and Monte-Carlo Go , 2009 .