@techreport{oai:ipsj.ixsq.nii.ac.jp:00068067,
 author = {秋山, 晴彦 and 小谷, 善行 and Haruhiko, Akiyama and Yoshiyuki, Kotani},
 issue = {7},
 month = {Mar},
 note = {モンテカルロ探索を入れ子的に呼び出すNested Monte-Carlo探索は，Morpion Solitaireというパズルゲームにおいて成果を上げている．入れ子の深さをレベルと呼び，上位レベルの探索では実行時間が指数関数的に増加する．本研究では，AMAF手法の手数の換算を用いて，擬似的な探索数を維持しつつ探索実行数を削減し，高速化による高レベル化を実現した．この手法によりMorpion SolitaireのTouchingルールにおいて，我々はコンピュータ探索の世界記録145手を達成した．, Nested Monte-Carlo Search, which calls Monte Carlo search in the nested call, has succeeded in the puzzle game named Morpion Solitaire. The depth for the nest is called a level, and the execution time increases exponentially in the search for meta level. In the present study, the number of search was reduced to maintain a pseudo number of searches by using the conversion of the AMAF technique, and we achieved the high level Nested Monte-Carlo search. Our system generated a new world record 145 moves of the computer search in Morpion Solitaire Touching version by this technique.},
 title = {Nested Monte-Carlo探索のAMAFを用いた探索数調整による改良},
 year = {2010}
}