The Journal: Staff and Finances
ICGA Journal · 1988
part of the tree.The details of this algorithm are given along with an explanation of the particular tree-searching problem each detail addresses.Test results were obtained using a Sequent Balance 11000 multiprocessor with 30 processors.When searching alpha-beta game trees with sixteen processors, the PVS algorithm provides a speedup of 4.59, the EPVS algorithm provides a speedup of 5.98 and the DTS algorithm provides a speedup of 8.81.The conclusions identify specific problem areas that must be addressed to improve these results.In particular, the sequential search must become more accurate in the nodes that it examines.Depth-fIrst trees are inherently parallel, but the alpha-beta algorithm adds a sequential property that makes then extremely difficult to search in parallel without adding search overhead that degrades the total performance."