Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Principles of artificial intelligence
Principles of artificial intelligence
A problem-reduction approach to the linguistic analysis of waveforms.
A problem-reduction approach to the linguistic analysis of waveforms.
Cooperating Sequential Processes, Technical Report EWD-123
Cooperating Sequential Processes, Technical Report EWD-123
Searching game trees in parallel using SSS*
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
A parallel implementation of iterative-deepening-A
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
A parallel implementation of iterative-deepening-A
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper explores the issues that arise when SSS*-like search algorithms are implemented in parallel. There is an important implicit assumption regarding the OPEN list of SSS* (and A*-like algorithms); those states which are guaranteed never to become part of an optimal solution are forced down into the OPEN list and never rise to the top for expansion. However. when multiple processors are introduced in a parallel version of SSS*. These buried states become subject to expansion despite their provable suboptimality. In such states are not identified and purged, they may exert an enormous drag on the parallel algorithm because considerable processor effort will be wasted, However, the pruning mechanisms of alpha-beta can be adapted by a parallel SSS*; the resulting algorithm HYBRID is suitable for searching game trees and general AND/OR trees in parallel.