Issue No. 05 - September (1988 vol. 10)

ISSN: 0162-8828

pp: 687-694

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.6777

ABSTRACT

<p>A parallel alpha-beta search algorithm called unsynchronized iteratively deepening parallel alpha-beta search is described. The algorithm's simple control strategy and strong performance in complicated positions make it a viable alternative to the principal variation splitting algorithm (PVSA). Processors independently carry out iteratively deepening searches on separate subsets of moves. The iterative deepening is unsynchronized, e.g. one processor may be in the middle of the fifth iteration while another is in the middle of the sixth. Narrow windows diminish the importance of backing-up a score to the root of the tree as quickly as possible (one of the principal objectives of the PVSA). Speedups measured on one, two, four, and eight chess-playing computers are reported.</p>

INDEX TERMS

unsynchronized iterative deepening search; parallel alpha-beta search algorithm; principal variation splitting algorithm; tree; iterative methods; parallel algorithms; search problems; trees (mathematics)

CITATION

M. Newborn, "Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search",

*IEEE Transactions on Pattern Analysis & Machine Intelligence*, vol. 10, no. , pp. 687-694, September 1988, doi:10.1109/34.6777