Time management for Monte-Carlo tree search applied to the game of Go

Proceedings - International Conference on Technologies and Applications of Artificial Intelligence, TAAI 2010

Volumn , Issue , 2010, Pages 462-466

  Huang, Shih Chieh ^a   Coulom, Remi ^b   Lin, Shun Shii ^a  

^a NATIONAL TAIWAN NORMAL UNIVERSITY   (Taiwan)

^b UNIV LILLE   (France)

Author keywords

Game of Go; Monte Carlo tree search; Time management

Indexed keywords

GAME OF GO; LEVEL 2; MONTE CARLO; TIME CONTROL; TIME MANAGEMENT; TIME-ALLOCATION; TREE SEARCH;

ARTIFICIAL INTELLIGENCE; POPULATION STATISTICS;

MANAGEMENT;

EID: 79951753159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TAAI.2010.78     Document Type: Conference Paper

References (15)

1. R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," in Proceedings of the 5th International Conference on Computer and Games, ser. Lecture Notes in Computer Science, H. J. van den Herik, P. Ciancarini, and H. J. Donkers, Eds., vol. 4630. Turin, Italy: Springer, Jun. 2006, pp. 72-83.
2. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modification of UCT with patterns in Monte-Carlo Go," INRIA, Tech. Rep. RR-6062, 2006.
3. L. Kocsis and C. Szepesvári, "Bandit-based Monte-Carlo planning," in Proceedings of the 15th European Conference on Machine Learning, J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, Eds., Berlin, Germany, 2006.
4. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proceedings of the 24th International Conference on Machine Learning, Corvallis Oregon USA, 2007, pp. 273-280.
5. G. Chaslot, M. Winands, B. Bouzy, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Progressive strategies for monte-carlo tree search," in Proceedings of the 10th Joint Conference on Information Sciences, P. Wang, Ed., Salt Lake City, USA, 2007, pp. 655-661.
6. R. Coulom, "Computing Elo ratings of move patterns in the game of Go," in Proceedings of the Computer Games Workshop, H. J. van den Herik, M. Winands, J. Uiterwijk, and M. Schadd, Eds., Amsterdam, The Netherlands, Jun. 2007, pp. 113-124.
7. "Byo-yomi," Wikipedia, http://en.wikipedia.org/wiki/Byoyomi.
8. R. M. Hyatt, "Using time wisely," ICCA Journal, vol. 7, no. 1, pp. 4-9, Mar. 1984.
9. S. Markovitch and Y. Sella, "Learning of resource allocation strategies for game playing," Computational Intelligence, vol. 12, pp. 88-105, 1996.
10. E. B. Baum and W. D. Smith, "A Bayesian approach to relevance in game playing," Artificial Intelligence, vol. 97, no. 1-2, pp. 195-242, 1997. (Pubitemid 127401105)
11. H. Yoshimoto, K. Yoshizoe, T. Kaneko, A. Kishimoto, and K. Taura, "Monte Carlo Go has a way to go," in Proceedings of the 21st National Conference on Artificial Intelligence. AAAI Press, 2006, pp. 1070-1075. (Pubitemid 44705418)
12. R. Šolak and V. Vučković, "Time management during a chess game," ICGA Journal, vol. 32, no. 4, pp. 206-220, Dec. 2009.
13. B. Sheppard, M. Williams, D. Dailey, D. Hillis, C. Nentwich, M. Persson, D. Fotland, and M. Boon, "Tweak to MCTS selection criterion," computer-go mailing list, http://groups.google.com/group/computer-go-archive/ browse thread/thread/7531bef033ca31f6, Jun. 2009.
14. H. Yamashita, "time settings," computer-go mailing list, http://dvandva.org/pipermail/computer-go/2010-July/000687.html, Jul. 2010.
15. D. Silver, "Reinforcement learning and simulation-based search in computer Go," Ph.D. dissertation, University of Alberta, 2009.