@inproceedings{oai:ipsj.ixsq.nii.ac.jp:00106502,
 author = {横山, 秀 and 金子, 知適 and Shu, Yokoyama and Tomoyuki, Kaneko},
 book = {ゲームプログラミングワークショップ2014論文集},
 month = {Oct},
 note = {性能が低い安価なネットワークで接続された計算機環境を前提として研究されているゲーム木の局面分担方式での並列探索では，局面の分担を決定するためのマスタゲーム木を適切に構築することで，無駄な探索を行う計算機ノードを減らすことができる．本稿ではゲーム固有の知識によらず，探索時間を犠牲にすることのないマスタゲーム木の構築手法を提案する．また，この手法によるチェス探索を実装し，対局実験を行ったところ，計算ノード数によっては逐次探索よりも高性能で，並列化の効果が得られたことを確認した．, Asynchronous parallel game-tree search methods are effective ways to improve the playing strength by utilizing many computing nodes connected in low-cost network systems. This paper presents a method of making an improved plan for the assignment of computing nodes. In our framework, the master node manages the game-tree and makes an assignment based on the game-tree. Then, each computing node asynchronously searches the best move and evaluation for a position assigned to the node. To reduce the search overheads, the master's game-tree should be grown appropriately so that a better move has more computing nodes assigned in the corresponding sub game-tree for the move. We present two improvements over existing assignment; one is independence from game-specific knowledge and the other is the efficiency that makes the asynchronous parallel search framework suitable even for short time matches. We applied the proposed method to a top-level chess program, and evaluated the playing strength via self-plays. We confirmed that a program incorporated the presented method plays better than the original one when the number of the computing node are greater than or equak to eight.},
 pages = {82--88},
 publisher = {情報処理学会},
 title = {非同期並列ゲーム木探索での効果的な計算ノード割り当て},
 volume = {2014},
 year = {2014}
}