Using Monte Carlo Tree Search for replanning in a multistage simultaneous game

Daniel Beard, Philip Hingston, Martin Masek
2012 2012 IEEE Congress on Evolutionary Computation  
In this study, we introduce MC-TSAR, a Monte Carlo Tree Search algorithm for strategy selection in simultaneous multistage games. We evaluate the algorithm using a battle planning scenario in which replanning is possible. We show that the algorithm can be used to select a strategy that approximates a Nash equilibrium strategy, taking into account the possibility of switching strategies part way through the execution of the scenario in the light of new information on the progress of the battle.
doi:10.1109/cec.2012.6256428 dblp:conf/cec/BeardHM12 fatcat:o7zgk5f2ujek3efwyaddpaanpq