Abstract
This paper discusses two general schemes for performing branch-and-bound (B&B) search in parallel. These schemes are applicable in principle to most of the problems which can be solved by B&B. The schemes are implemented for SSS*, a versatile algorithm having applications in game tree search, structural pattern analysis, and AND/OR graph search. The performance of parallel SSS* is studied in the context of AND/OR tree and game tree search. The paper concludes with comments on potential applications of these parallel implementations of SSS* in structural pattern analysis and game playing.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 768-778 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Pattern Analysis and Machine Intelligence |
| Volume | PAMI-6 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 1984 |
Keywords
- AND/OR graphs
- branch-and-bound
- game trees
- minimax search
- parallel algorithms