2000 character limit reached
Multiple Tree for Partially Observable Monte-Carlo Tree Search
Published 8 Feb 2011 in cs.GT | (1102.1580v1)
Abstract: 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 results for the game of phantom tic-tac-toe, showing that strong strategies can be efficiently computed by our algorithm.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.