Multiple Tree for Partially Observable Monte-Carlo Tree Search

Details Multiple Tree for Partially Observable Monte-Carlo Tree Search Multiple Tree for Partially Observable Monte-Carlo Tree Search

2011-02-08

arxiv.org/abs/1102.1580v1

Computer Science

Computer Science and Game Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Multiple Tree for Partially Observable Monte-Carlo Tree Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Multiple Tree for Partially Observable Monte-Carlo Tree Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiple Tree for Partially Observable Monte-Carlo Tree Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-502289