Multiple Tree for Partially Observable Monte-Carlo Tree Search

David Auger

We propose an algorithm for computing approximate Nash equilibria of partially observable games using Monte-Carlo tree search based on recent bandit methods. We obtain experimental…