@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00095816,
 author = {太田, 雄大 and 伊藤, 雅 and Takehiro, Ohta and Masaru, Itoh},
 book = {ゲームプログラミングワークショップ2013論文集},
 month = {Nov},
 note = {モンテカルロ木探索におけるプレイアウトの効率化の研究は活発に行われてきた.しかし,プレイアウトの多様性についての研究はあまりされていない.そこで,本研究ではモダンヒューリスティクスの一つであるタブーサーチをプレイアウトに適用することを提案する.プレイアウトを行った局面をタブーリストに追加し,タブー期間探索するのを禁止する.また,タブー期間を過ぎた局面をタブーリストから取り除く.それによりプレイアウトの多様性を確保することができる.数値実験を対局及び詰碁にて行い,タブーサーチを内包したモンテカルロ木探索は単純なモンテカルロ木探索に比べて良い性能が得られた., Efficiency of playout in Monte Carlo tree search (MCTS) have been extensively studied up to now. However, diversity of playout is not really investigated. Because of that, this paper refers to the diversity in MCTS. So this paper proposes to combine MCTS with tabu search (TA), which is a modern heuristic technique for combinatorial problems, into the computer igo algorithm. Once a phase of the playout is added into a tabu list, the searching method prohibits the adoption of the same phase during a given tabu tenure. When the number of trials for playouts is greater than the tabu tenure, the phase is removed from the tabu list. And then the phase could be adopted again. Thus the proposed method can be obtained to ensure the diversity of playout as a whole. The numerical results for some life-and-death igo problems shows that the method of MCTS including TA have obviously got an advantage over the simple MCTS algorithm with the view of the right moves.},
 pages = {90--93},
 publisher = {情報処理学会},
 title = {タブーサーチを内包したモンテカルロ木探索に基づく囲碁アルゴリズム},
 year = {2013}
}