Learning non-random moves for playing Othello: Improving Monte Carlo Tree Search

2011 IEEE Conference on Computational Intelligence and Games, CIG 2011

Volumn , Issue , 2011, Pages 305-312

  Robles, David ^a   Rohlfshagen, Philipp ^a   Lucas, Simon M ^a  

^a UNIVERSITY OF ESSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOARD GAMES; DOMAIN-SPECIFIC KNOWLEDGE; FUNCTION APPROXIMATORS; GENERAL APPROACH; LINEAR FUNCTIONS; MC SIMULATION; MINIMAX; MONTE CARLO; MONTE CARLO SIMULATIONS; NON-TRIVIAL; OTHELLO; STATE-VALUE FUNCTIONS; TEMPORAL DIFFERENCE LEARNING; TREE SEARCH; UPPER CONFIDENCE BOUND; VALUE FUNCTIONS;

ARTIFICIAL INTELLIGENCE; DIGITAL TO ANALOG CONVERSION; GAME THEORY; LEARNING ALGORITHMS; MONTE CARLO METHODS;

PLANT EXTRACTS;

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

References (28)

1. B. Abramson. Expected-Outcome: a General Model of Static Evaluation. IEEE PAMI, 12:182-193, 1990. (Pubitemid 20666142)
2. P. Auer, N. Cesa-Bianchi, and P. Fischer. Finite-Time Analysis of the Multiarmed Bandit Problem. Machine Learning, 47(2):235-256, 2002. (Pubitemid 34126111)
3. J. Baxter, A. Tridgell, and L. Weaver. Experiments in Parameter Learning Using Temporal Differences. International Computer Chess Association Journal, 21(2):84-99, 1998.
4. Y. Björnsson and H. Hilmar. CADIAPlayer: a Simulation-Based General Game Player. IEEE Transactions on Computational Intelligence and AI in Games, pages 4-15, 2009.
5. M. Buro. LOGISTELLO: A Strong Learning Othello Program. 19th Annual Conference Gesellschaft für Klassifikation e.V., pages 1-3, 1995.
6. M. Buro. From Simple Features to Sophisticated Evaluation Functions. In 1st International Conference on Computer and Games, pages 126-145, 1999.
7. Michael Buro. The Evolution of Strong Othello Programs. In Entertainment Computing - Technology and Applications, pages 81-88, 2003.
8. M. Campbell, A. J. Hoane, and F.-H. Hsu. Deep Blue. Artificial Intelligence, 134(1-2):57-83, 2002. (Pubitemid 34086579)
9. R. Coulom. Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In Proceedings of the 5th International Conference on Computers and Games, pages 72-83, 2006.
10. S. Gelly and D. Silver. Combining Online and Offline Knowledge in UCT. In Proceedings of the 24th International Conference on Machine Learning, pages 273-280, 2007.
11. S. Gelly and D. Silver. Monte-Carlo Tree Search and Rapid Action Value Estimation in Computer Go. Artificial Intelligence, pages 1-33, 2011.
12. S. Gelly, Y. Wang, R. Munos, and O. Teytaud. Modification of UCT with Patterns in Monte-Carlo Go. Technical report, INRIA, 2006.
13. D. P. Helmbold. All-Moves-As-First Heuristics in Monte-Carlo Go. In Proceedings of the 2009 International Conference on Artificial Intelligence, pages 605-610, 2009.
14. P. Hingston and M. Masek. Experiments with Monte Carlo Othello. In IEEE Congress on Evolutionary Computation, pages 4059-4064, 2007. (Pubitemid 351371926)
15. S. C. Huang, R. Coulom, and S. S. Lin. Monte-Carlo Simulation Balancing in Practice. Computers and Games, pages 81-92, 2011.
16. L. Kocsis and C. Szepesvári. Bandit Based Monte-Carlo Planning. Machine Learning: ECML 2006, pages 282-293, 2006. (Pubitemid 44618839)
17. R. Lorentz. Amazons Discover Monte-Carlo. Computers and Games, pages 13-24, 2008.
18. S. M. Lucas and T. P. Runarsson. Temporal difference learning versus co-evolution for acquiring Othello position evaluation. In Computational Intelligence and Games, 2006 IEEE Symposium on, pages 52-59, 2006.
19. S.M. Lucas. Learning to Play Othello with N-Tuple Systems. Australian Journal of Intelligent Information Processing, pages 1-20, 2008.
20. S.M. Lucas and K.T. Cho. Fast Convolutional OCR with the Scanning N-tuple Grid. In International Conference on Document Analysis and Recognition, pages 799-803, 2005.
21. Y. Osaki, K. Shibahara, Y. Tajima, and Y. Kotani. An Othello Evaluation Function Based on Temporal Difference Learning using Probability of Winning. In IEEE Symposium on Computational Intelligence and Games, 2008.
22. J. Schaeffer. One Jump Ahead: Computer Perfection at Checkers. Springer Publishing Company, Incorporated, 2nd edition, 2008.
23. J. Schaeffer, M. Hlynka, and V. Jussila. Temporal Difference Learning Applied to a High-Performance Game-Playing Program. Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 529-534, 2001.
24. D. Silver. Reinforcement Learning and Simulation-Based Search. PhD thesis, University of Alberta, 2009.
25. D. Silver, R. Sutton, and M. Müller. Reinforcement Learning of Local Shape in the Game of Go. In Proceedings of the 20th International Joint Conference on Artifical Intelligence, 2007.
26. D. Silver and G. Tesauro. Monte-Carlo Simulation Balancing. In Proceedings of the 26th Annual International Conference on Maseke Learning, pages 1-8, 2009.
27. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
28. C. Szepesvári. Algorithms for Reinforcement Learning. Morgan and Claypool Publishers, 2010.