Hi, This is my GPW08 paper.
Parallel Monte-Carlo Tree Search with Simulation Servers by Hideki Kato and Ikuo Takeuchi Abstract: Recently Monte-Carlo tree search is boosting the performance of computer Go playing programs. A novel parallel Monte-Carlo tree search algorithm is proposed. A tree searcher runs on a client computer and multiple Monte-Carlo simulation servers run on other computers on a network. The client broadcasts a position to be simulated to every server, which then simulates a game from the position to the end and sends the result (win or loss) back to the client. The statistical information in the search tree is updated by the client according to the result. This architecture allows servers on-the-fly connection or disconnection. Experimental results using four quad-core Linux computers on a private Gigabit Ethernet LAN show its performance scales well. http://www.gggo.jp/publications/gpw08-private.pdf http://www.gggo.jp/publications/gpw08.ppt If you read the paper, please check gpw08.ppt together as it contains revised charts which will help avoid confusion. Hideki -- [EMAIL PROTECTED] (Kato) _______________________________________________ computer-go mailing list [email protected] http://www.computer-go.org/mailman/listinfo/computer-go/
