A UCT agent for Tron: Initial investigations

Monte Carlo Tree Search(MCTS) has generated a great deal of excitement in the A.I. community, mainly due to its success in Go. In this paper we test this approach in Tron, a simultaneous move two-agent game. Although the agents created are able to play to a good standard, there is a degree of randomness in their decisions in identical scenarios. This suggests that the success of MCTS is heavily dependent on the suitability of each individual game for Monte-Carlo Simulations.