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.
CITATION STYLE
Koenitz, H. (2018). Narrative in Video Games. In Encyclopedia of Computer Graphics and Games (pp. 1–9). Springer International Publishing. https://doi.org/10.1007/978-3-319-08234-9_154-1
Mendeley helps you to discover research relevant for your work.