IEEE CIS Webinar on "The Magic of Monte Carlo Tree Search", 4pm (BST), Friday, Sept. 29 2017

Speaker

Dr. Mark Winands, Associate Professor, Department of Data Science & Knowledge Engineering, Maastricht University. 

Abstract

Monte-Carlo Tree Search (MCTS) has caused a revolution in computer game-playing the last few years. The most well-known example is the game of Go. MCTS is a best-first search technique that gradually builds up a search tree, guided by  Monte-Carlo  simulations. In contrast to many classic search techniques, MCTS does not require a heuristic evaluation function that assesses the current board position. In this talk I will discuss its background, basic mechanism, and standard enhancements that have improved the technique considerably. Successful applications of the technique in several domains will be mentioned.

Bio

Mark Winands received a Ph.D. degree in Artificial Intelligence from the Department of Computer Science, Maastricht University, Maastricht, The Netherlands, in 2004. Currently, he is an Associate Professor at the Department of Data Science & Knowledge Engineering, Maastricht University. His research interests include heuristic search, machine learning and games. He has written more than eighty scientific publications on Games & AI. Mark serves as an editor-in-chief of the ICGA Journal, associate editor of IEEE Transactions on Computational Intelligence and AI in Games, editor of Game & Puzzle Design. He is a member of the Games Technical Committee (GTC) | IEEE Computational Intelligence Society, and member of working group 14.4 – Entertainment Games | IFIP TC14 on Entertainment Computing.


Please register for The Magic of Monte Carlo Tree Search - Sep 29, 2017 on 4:00 PM BST at: 
https://attendee.gotowebinar.com/register/5997375619679435011