Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search

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.