Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search
Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search
复制标题
异步并行博弈树搜索中的无参数树型管道
DOI：
10.1007/978-3-319-27992-3_19
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
and T. Tetsuro
中科院分区：
文献类型：
--
作者：
S. Yokoyama;T. Kaneko;and T. Tetsuro
异步并行游戏树搜索方法通过使用通过相对较慢的网络连接的多台计算机来有效提高游戏强度。在游戏位置并行化中，主程序管理游戏树并将树中的位置分配给工作人员。然后，每个工作人员异步搜索最佳移动及其分配位置的相应评估。我们提出了一种构建适当的主树的新方法，该方法提供了更重要的动作，并在其子树上有更多的工作人员，以提高游戏强度。我们的贡献有两个优点：（1）无参数，用户不需要通过反复试验来调整参数；（2）效率甚至适合短时间比赛，例如每次移动一秒。我们用顶级国际象棋程序 Stockfish 在国际象棋中实现了我们的方法，并通过自我对弈来评估棋力。我们确认，多达 60 名工人的参与强度有所提高。
Asynchronous parallel game-tree search methods are effective in improving the playing strength by using many computers connected through relatively slow networks. In game-position parallelization, the master program manages a game-tree and distributes positions in the tree to workers. Then, each worker asynchronously searches the best move and the corresponding evaluation for its assigned position. We present a new method for constructing an appropriate master tree that provides more important moves with more workers on their sub-trees to improve the playing strength. Our contribution introduces two advantages: (1) being parameter free in that users do not need to tune parameters through trial and error, and (2) efficiency suitable even for short-time matches, such as one second per move. We implemented our method in chess with a top-level chess programStockfishand evaluated the playing strength through self-plays. We confirm that the playing strength improves with up to sixty workers.