search

morris821028 / hw-HikaruNoGo

Go Game: Monte - Carlo Tree Search & Upper Confidence Bound
0 stars 0 forks source link

UCB formula & Variance #3

Open morris821028 opened 8 years ago

morris821028 commented 8 years ago

source http://mcts.ai/about/index.html

Kocsis and Szepervari (2006) first formalised a complete MCTS algorithm by extending UCB to minimax tree search and named it the Upper Confidence Bounds for Trees (UCT) method. This is the algorithm used in the vast majority of current MCTS implementations.

UCT may be described as a special case of MCTS, that is: UCT = MCTS + UCB.

同時可以參考 http://mcts.ai/code/java.html 的命名方法