Parallelism in alpha-beta search

doi:10.1016/0004-3702(82)90022-4

Artificial Intelligence

Volume 19, Issue 1, September 1982, Pages 89-106

https://doi.org/10.1016/0004-3702(82)90022-4 Get rights and content

Abstract

We present a distributed algorithm for implementing α-β search on a tree of processors. Each processor is an independent computer with its own memory and is connected by communication lines to each of its nearest neighbors. Measurements of the algorithm's performance on the Arachne distributed operating system are presented. A theoretical model is developed that predicts at least order of $k^{12}$ speedup with k processors.

References (7)

H.J. Berliner
A chronology of computer chess and its literature
Artificial Intelligence
(1978)
D.E. Knuth et al.
An analysis of alpha-beta pruning
Artificial Intelligence
(1975)
G.M. Baudet
The design and analysis of algorithms for asynchronous multiprocessors
(1978)

There are more references available in the full text version of this article.

Cited by (42)

Game tree algorithms and solution trees
2001, Theoretical Computer Science
In this paper a theory of game tree algorithms is presented, entirely based upon the concept of a solution tree. Two types of solution trees are distinguished: max and min trees. Every game tree algorithm tries to prune as many nodes as possible from the game tree. A cut-off criterion in terms of solution trees will be formulated, which can be used to eliminate nodes from the search without affecting the result. Further, we show that any algorithm actually constructs a superposition of a max and a min solution tree. Finally, we will see how solution trees and the related cutoff criterion are applied in major game tree algorithms like alphabeta and MTD.
A Parallel Game Tree Search Algorithm With A Linear Speedup
1993, Journal of Algorithms
In the theoretical analysis of the average run time of game tree search algorithms it is assumed for simplicity that in every elementary unit of time each processor can reveal the value of one leaf node. Until now there exists only one nontrivial stochastic game tree model for which the optimal sequential (= 1-processor) algorithm is known. For this model the author presents a parallel algorithm which involves n processors and achieves a linear speedup of better than 201/n in binary trees of depth 6n[log n] for all natural numbers n. This result can be generalized in two directions: (1) (1/k)n^k processors can achieve a speedup of (201)^kk/n^k in binary trees of depth 6n[log n]. (2) Similar algorithms with a linear speedup exist for "all" recursion trees in which directional search is optimal.
Backpac: A parallel goal-driven reasoning system
1992, Information Sciences
To handle complex problems of the type solved by human experts, knowledge bases will need to become larger than 10,000 chunks of knowledge. In order to provide necessary response times it appears that parallel inference must be considered. The advent of affordable parallel processing computers may allow the use of parallel inference to decrease reasoning time. In this paper we discuss Backpac, a backward-chained inferencing system designed to run on parallel processor machines. The system has been developed in Multilisp and rewritten in mul-t. The system has been tested on a 10 processor Encore Multimax in both languages. Several experiments, in Multilisp, have been run on the Concert [22] multiprocessor at the Harris Corporation. The speedups have ranged as high as an order of magnitude.
Parallel search in bivalued game trees
1991, Journal of Parallel and Distributed Computing
Three parallel search strategies in bivalued game trees are described and compared in this paper. Two of them, the Top-Down and Bottom-Up Strategies, distribute available processors statically in the upper and lower levels of the game tree, respectively. The third strategy is more dynamic and needs information at the inner nodes of the search tree to decide whether the processors should be distributed at one node. For these search strategies formulas for the behavior of the average run time are developed, on the basis of a general probabilistic game tree model. The theoretical results obtained can be used to analyze the performance of the parallel search strategies before implementing them on a parallel computer. The three investigated parallel search strategies are tested empirically for a real game on a Transputer network. The empirical results match the theoretical results, indicating that the third strategy is best and the top-down strategy is worst.
A parallel alpha/beta tree searching algorithm
1989, Parallel Computing
This paper gives a theoretical foundation for using parallel processing to search an alpha/beta minimax game tree. A mathematical discussion predicts the behavior of a particular parallel algorithm, Principle Variation Splitting (PVS), along with an enhancement that improves performance for most test cares. After the theoretical discussion, some practical results obtained by running two implementations of the PVS algorithm on a 30-processor tightly coupled shared memory machine are given to show the speedup obtained by parallel processing.
Computer Chess: Ten Years of Significant Progress
1989, Advances in Computers
The chapter describes the technical developments that are responsible for the present strong level of computer chess. Since 1979, there have been a number of new developments including special-purpose hardware, parallel search on multiprocessing systems, windowing techniques, and increased use of transposition tables. The chapter describes these advances. It reviews various search techniques that improved chess programs: the minimax algorithm; depth-first search and the basic data structures for chess trees; the alpha-beta algorithm; move generation, the principal continuation, and the killer heuristic; pruning techniques and variable depth quiescence search; transposition tables; iterative deepening; windows, parallel search techniques; special-purpose hardware; and time control and thinking on the opponent's time. The chapter also presents a brief history of computer chess play and relation between computer speed and program strength—faster computers play better chess. The chapter also illustrates a sample computer chess game played between DEEP THOUGHT 0.02 and HITECH in the third round of the ACM's 19th North American Computer Chess Championship in Orlando, Florida in November 1988.

View all citing articles on Scopus

View full text

Parallelism in alpha-beta search

Abstract

Artificial Intelligence

Artificial Intelligence

The design and analysis of algorithms for asynchronous multiprocessors