Prior Estimation in UCT based on the Sequential Halving Algorithm

IPSJ

Description

In this research, we utilize the sequential halving algorithm, which is a pure exploration bandit algorithm, for obtaining a prior estimation in the UCT algorithm, and demonstrate its performance and characteristics on 9 × 9 Go

In this research, we utilize the sequential halving algorithm, which is a pure exploration bandit algorithm, for obtaining a prior estimation in the UCT algorithm, and demonstrate its performance and characteristics on 9 × 9 Go

Journal

Details 詳細情報について

Report a problem

Back to top