Physical Sciences and Mathematics Commons^™

Using Monte Carlo Tree Search For Replanning In A Multistage Simultaneous Game, Daniel Beard, Philip Hingston, Martin Masek

Martin Masek

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.