This article was published for AiGameDev.com PREMIUM members, available by subscription. You can join here in a minute or less. If you're already a member, log-in from the top right menu.
Applying Monte-Carlo Tree Search (MCTS) to The Octagon Theory
Alex J. Champandard on January 8, 2014
Monte-Carlo Tree Search is a promising technique that is revolutionizing board game AI. In this interview, find out how MCTS can be applied to The Octagon Theory, a mobile game which combines challenges similar to Othello or Go. What's necessary to build a competitive AI with probabilistic search techniques? How do you take into account opponent models into the process?
Access the rest of this feature by joining industry experts and other professionals as a PREMIUM member in the leading Game AI training program.