Prior Estimation in UCT based on the Sequential Halving Algorithm

情報処理学会

説明

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

収録刊行物

詳細情報 詳細情報について

問題の指摘

ページトップへ