Net parallel chess tree searching model using PVM

	Net parallel chess tree searching model using PVM
	Wang, Jinghui; Qiao, Weimin
刊名	Jisuanji Gongcheng/Computer Engineering
	2005
卷号	31 页码:29-30+126
ISSN号	1000-3428
英文摘要	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.
出版者	Shanghai Computer Society, Shanghai, China
内容类型	期刊论文
源URL	[http://119.78.100.186/handle/113462/64206]
专题	中国科学院近代物理研究所
作者单位	Institute of Modern Physics, Chinese Academy of Sciences, Lanzhou 730000, China
推荐引用方式 GB/T 7714	Wang, Jinghui,Qiao, Weimin. Net parallel chess tree searching model using PVM[J]. Jisuanji Gongcheng/Computer Engineering,2005,31:29-30+126.
APA	Wang, Jinghui,&Qiao, Weimin.(2005).Net parallel chess tree searching model using PVM.Jisuanji Gongcheng/Computer Engineering,31,29-30+126.
MLA	Wang, Jinghui,et al."Net parallel chess tree searching model using PVM".Jisuanji Gongcheng/Computer Engineering 31(2005):29-30+126.