2026-03-13T21:24:51Z https://ipsj.ixsq.nii.ac.jp/oai

oai:ipsj.ixsq.nii.ac.jp:00106508 2025-01-21T09:29:44Z 6164:6165:6210:7725

A Study of Software Framework for Parallel Monte Carlo Tree Search A Study of Software Framework for Parallel Monte Carlo Tree Search Ting-FuLiao I-ChenWu Guan-WunChen Chung-ChinShih Po-YaKang Bing-TsungChiang Ting-ChuHo Ti-RongWu Ting-Fu, Liao I-Chen, Wu Guan-Wun, Chen Chung-Chin, Shih Po-Ya, Kang Bing-Tsung, Chiang Ting-Chu, Ho Ti-Rong, Wu Monte-Carlo tree search (MCTS) has been successful on improving the strength of the game Go as well as many other game playing programs. For MCTS, one of the critical issues to further improve strength is parallelization. In order to deal with parallel MCTS generally, this paper designs a software framework for developing computer game programs with parallel MCTS. This framework hides the details of game-independent designs from computer game developers, so that developers can concentrate on improving heuristics related to game-specific knowledge. In this framework, we used lock-free tree parallelization inside a shared-memory system, and root parallelization over a distributed-memory system. For demonstration, we implemented a Go program named AMIGO, a Chinese dark chess program, and a puzzle program on top of this framework. The experimental results of AMIGO for 9x9 Go also show reasonable speedups and the strength improvement. Monte-Carlo tree search (MCTS) has been successful on improving the strength of the game Go as well as many other game playing programs. For MCTS, one of the critical issues to further improve strength is parallelization. In order to deal with parallel MCTS generally, this paper designs a software framework for developing computer game programs with parallel MCTS. This framework hides the details of game-independent designs from computer game developers, so that developers can concentrate on improving heuristics related to game-specific knowledge. In this framework, we used lock-free tree parallelization inside a shared-memory system, and root parallelization over a distributed-memory system. For demonstration, we implemented a Go program named AMIGO, a Chinese dark chess program, and a puzzle program on top of this framework. The experimental results of AMIGO for 9x9 Go also show reasonable speedups and the strength improvement. 情報処理学会 2014-10-31 eng conference paper https://ipsj.ixsq.nii.ac.jp/records/106508 ゲームプログラミングワークショップ2014論文集 2014 122 126 https://ipsj.ixsq.nii.ac.jp/record/106508/files/IPSJ-GPWS2014018.pdf application/pdf 1.4 MB 2014-10-31