The key node method: a highly-parallel alpha-beta algorithm

Update Item Information
Publication Type Journal Article
School or College College of Engineering
Department Computing, School of
Creator Lindstrom, Gary E.
Title The key node method: a highly-parallel alpha-beta algorithm
Date 1983
Description A new parallel formulation of the alpha-beta algorithm for minimax game tree searching is presented. Its chief characteristic is incremental information sharing among subsearch processes in the form of "provisional" node value communication. Such "eager" communication can offer the double benefit of faster search focusing and enhanced parallelism. This effect is particularly advantageous in the prevalent case when static value correlation exists among adjacent nodes. A message-passing formulation of this idea, termed the "Key Node Method", is outlined. Preliminary experimental results for this method are reported, supporting its validity and potential for increased speedup.
Type Text
Publisher University of Utah
First Page 1
Last Page 21
Subject Key node method; Alpha-beta algorithm; Minimax; Game tree searching
Language eng
Bibliographic Citation Lindstrom, G. E. (1983). The key node method: a highly-parallel alpha-beta algorithm. 1-21 UUCS-83-101.
Series University of Utah Computer Science Technical Report
Relation is Part of ARPANET
Rights Management ©University of Utah
Format Medium application/pdf
Format Extent 3,204,694 bytes
Identifier ir-main,15990
ARK ark:/87278/s64t72vq
Setname ir_uspace
ID 705858
Reference URL https://collections.lib.utah.edu/ark:/87278/s64t72vq