Parallel alpha-beta search on shared memory multiprocessors

  title={Parallel alpha-beta search on shared memory multiprocessors},
  author={Valavan Manohararajah},
2001 The alpha-beta algorithm is a well known method for the sequential search of game trees. Two methods, young brothers wait concept and dynamic tree splitting, have been used successfully in parallel game tree search. First, this work introduces the notion of an exponentially ordered game tree as a model for the game trees encountered in practice. Second, exponentially ordered trees are used in the study of the tree splitting methods used by young brothers wait concept and dynamic tree… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 20 extracted citations

A Parallel Algorithm for Game Tree Search Using GPGPU

IEEE Transactions on Parallel and Distributed Systems • 2015
View 11 Excerpts
Highly Influenced

Acceleration of game tree search using GPGPU

2015 International Conference on Green Computing and Internet of Things (ICGCIoT) • 2015

Parallelization of Node Based Game Tree Search Algorithm on GPU Ms .

Rutuja U. Gosavi, Mrs. Archana S. Vaidya
View 1 Excerpt

fewer than 50 Citations

Citations per Year
Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…