Article ID Journal Published Year Pages File Type
4952488 Theoretical Computer Science 2016 14 Pages PDF
Abstract
In this paper, we present an analysis of the bound on simple regret for the CCB bandit algorithm. We also give a comprehensive overview of how different choices of the exploration factor impact the games of 9×9 Go and 9×9 Nogo.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
Authors
, ,