Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
Complex games such as RTS games are naturally formalized
as Markov games. Given a Markov game, it is often possible
to hand-code or learn a set of policies that capture the
diversity of possible strategies. It is also often possible to
hand-code or learn an abstract simulator of the game...