Combining final score with winning percentage by sigmoid function in Monte-Carlo simulations

2008 IEEE Symposium on Computational Intelligence and Games, CIG 2008

Volumn , Issue , 2008, Pages 183-190

  Shibahara, Kazutomo ^a   Kotani, Yoshiyuki ^a  

^a TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

MEAN VALUES; MONTE CARLO; MONTE CARLO SIMULATION; RANDOM SIMULATION; SIGMOID FUNCTION;

ARTIFICIAL INTELLIGENCE; GAME THEORY;

MONTE CARLO METHODS;

EID: 70349282005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2008.5035638     Document Type: Conference Paper

References (16)

1. Bernd Brüegmann: Monte Carlo Go, Technical report, Physics Department, Syracuse University, unpublished, 1993.
2. Bruno Bouzy and Bernard Helmstetter: Monte Carlo go developments, Advances in Computer Games conference (ACG-10), pp. 159-174, 2003.
3. Bruno Bouzy: Associating Shallow and selective global tree search with Monte Carlo for 9 9 Go, 4rd Computer and Games Conference, CG04, Ramat-Gan, Israel, LNCS 3846/2006, pages 67-80, 2004.
4. Ŕemi Coulom: Efficient Selectivity and Backup Operators in Monte- Carlo Tree Search, Proceedings of the 5th Computers and Games Conference (CG 2006), pp.29-31, 2007.
5. Levente Kocsis and Csaba Szepesv́ari. Bandit-based monte-carlo planning: In 15the European Conference on Machine Learning(ECML), pp. 282-293, 2006.
6. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite time analysis of the multiarmed bandit problem. Machine Learning, 47(2-3), pp. 235-256, 2002.
7. Sylvain Gelly and David Silver: Combining Online and Offline Knowledge in UCT, International Conference of Machine Learning, ICML 2007, Corvallis Oregon USA, pp. 273-280, 2007.
8. Ŕemi Coulom: Monte-Carlo Tree Search in Crazy Stone, Game Programming Workshop 2007 pp.74-75, 2007.
9. Junichi Hashimoto, Tsuyoshi Hashimoto and Jun Nagashima: A potential application of Monte-Carlo Method in Computer Shogi, Game Programming Workshop 2006, pp.195-198, 2006.
10. Shugo Nakamura, Makoto Miwa and Takashi Chikayama: Improvement of UCT using evaluation function, Game Programming Workshop 2007 pp. 36-43, 2007.
11. Tristan Cazenave: A Phantom-Go Program, ACG2005, pp.120-125, 2005.
12. Guillaume Chaslot, Mark Winands, H. Jaap van den Herik, Jos Uiterwijk, and Bruno Bouzy: Progressive strategies for Monte-Carlo tree search, In Joint Conference on Information Sciences, 2007.
13. Sylvain Gelly and Yizao Wang: Exploration exploitation in Go: UCT for Monte-Carlo Go, Twentieth Annual Conference on Neural Information Processing Systems (NIPS2006), 2006.
14. Tristan Cazenave and Bernard Helmstetter: Combining tactical search and Monte-Carlo in the game of go. IEEE CIG2005, pp. 171-175, 2005.
15. Bruno Bouzy: Old-fashioned Computer Go vs Monte-Carlo Go, Invited tutorial, IEEE 2007 Symposium on Computational Intelligence in Games, CIG 07, unpublished, 2007.
16. Kunihito Hoki: Optimal control of minimax search results to learn positional evaluation, Game Programming Workshop 2006, pp.78-83, 2006.