| 基于PVM的博弈树的网络并行搜索 |
| |
| 引用本文： | 王京辉,乔卫民.基于PVM的博弈树的网络并行搜索[J].计算机工程,2005,31(9):29-30,126. |
| |
| 作者姓名： | 王京辉 乔卫民 |
| |
| 作者单位： | 中国科学院近代物理研究所,兰州,730000 |
| |
| 基金项目： | HIRFL_CSR国家重点实验室国家“九五”重大科学项目 |
| |
| 摘 要： | 通过分析博弈理论和a-b剪枝搜索过程,提出了使用PVM构造并行搜索网络.设计和实现了基于PVM的博弈树并行搜索过程.在博弈树搜索中通过构造的并行搜索网络和使用分而治之的策略把搜索过程分布在多个计算机上同时进行,在叶计算机结点的搜索中,通过a-b剪枝技术,剪枝了大量的搜索结点.全局并行搜索和局部剪枝技术的使用,加快了搜索的速度,解决了使用单计算机搜索速度和时间不可行的问题.该博弈并行搜索模型,适用于一般的博弈树搜索问题.
|
| 关 键 词： | PVM 并行搜索 博弈树搜索 树型网络 α-β剪枝技术 |
| 文章编号： | 1000-3428(2005)09-0029-02 |
A Net Parallel Chess Tree Searching Model Using PVM |
| |
| WANG Jinghui,QIAO Weimin.A Net Parallel Chess Tree Searching Model Using PVM[J].Computer Engineering,2005,31(9):29-30,126. |
| |
| Authors: | WANG Jinghui QIAO Weimin |
| |
| Abstract: | This article analyses the theory of chess tree and Alpha Beta pruning, proposes using PVM to construct parallel search network. The article designs and implements the parallel search process using PVM in chess tree. In chess tree searching process, through constructing the parallel network, the problem can divide and conquer. Using Alpha Beta technology, many of joints of leaf which need to search will be pruned. Using parallel search method and Alpha Beta pruning technology accelerates the searching speed. It solves the problems that a single computer cannot solve. The model can be used to solve other parallel chess tree problems. |
| |
| Keywords: | Parallel virtual machine(PVM) Parallel searching Tree search Tree-type network Alpha-Beta pruning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
