Monte Carlo Tree Search

The process of Upper Confidence Bounds for Trees (UCT) 1. Selection Starting at the root node R, search a node L which is not expanded fully. Specifically, we use UCB(upper confidence bound) algorithm

>>阅读原文<<