Implementation of an Othello Program Based on Monte-Carlo Tree Search by Using a Multi-Core Processor and SIMD Instructions
Yuji Kubota, Yoshikuni Sato, Daisuke Takahashi · 2009
Recently Monte-Carlo Tree Search is attracting attention in Computer-Go. Because the performance of Monte-Carlo Tree Search is related to the execution speed of playouts, programs become stronger by executing playouts faster. In this paper, we aim to accelerate playouts of an Othello program based on Monte-Carlo Tree Search. We implemented an Othello program based on Monte-Carlo Tree Search by using Cell B. E. that is a multi-core processor and SIMD instructions and evaluated the speed-up of playouts. We accelerated the processing to reverse pieces by using SIMD instructions and parallelized playouts by using a multi-core prosessor. Furthermore our experiments showed that the speed-up of playouts raised win rate.