ALTERNATIVE SELECTION FUNCTIONS FOR INFORMATION SET MONTE CARLO TREE SEARCH
We evaluate the performance of various selection methods for the Monte Carlo Tree Search algorithm in two-player zero-sum extensive-form games with imperfect information. We compare the standard Upper Confident Bounds applied to Trees (UCT) along with the less common Exponential Weights for Explorat...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CTU Central Library
2014-10-01
|
| Series: | Acta Polytechnica |
| Online Access: | https://ojs.cvut.cz/ojs/index.php/ap/article/view/2230 |