𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel alpha/beta tree searching algorithm

✍ Scribed by Robert M Hyatt; Bruce W Suter; Harry L Nelson

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
688 KB
Volume
10
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallelism in alpha-beta search
Parallelism in alpha-beta search
✍ Raphael A. Finkel; John P. Fishburn πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 782 KB

We present a distributed algorithm for implementing a-~ 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 opera

A simple parallel tree contraction algor
A simple parallel tree contraction algorithm
✍ K Abrahamson; N Dadoun; D.G Kirkpatrick; T Przytycka πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 952 KB
A comparison of minimax tree search algo
A comparison of minimax tree search algorithms
✍ Murray S. Campbell; T.A. Marsland πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 849 KB

Although theoretic performance measures of most game-searching algorithms exist, for various reasons their practicality is limited. This paper examines and extends the existing search methods, and reports on empirical performance studies on trees with useful size and ordering properties. Emphasis is