Searching game trees in parallel using SSS*

Authors:
Subir Bhattacharya;A. Bagchi
Affiliations:
Computer Aided Management Centre, Indian Institute of Management Calcutta, Calcutta, India;Computer Aided Management Centre, Indian Institute of Management Calcutta, Calcutta, India
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Year:
1989

Citing 3
Cited 0

Heuristics: intelligent search strategies for computer problem solving

Heuristics: intelligent search strategies for computer problem solving
A hybrid SSS*/alpha-beta algorithm for parallel search of game trees

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
A parallel implementation of iterative-deepening-A

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

PARSSS* is a parallel formulation of SSS* that is suitable for shared-memory multiprocessor systems. It is based on the distributed tree search paradigm of Ferguson and Korf. The main difficulty in parallelizing SSS* lies in achieving proper coordination between processes running on different subtrees of the game tree. This has been resolved in PARSSS* by the use of a shared array which maintains summary information on all processes that are currently in execution. Problem-independent speed-up values for PARSSS* have been obtained experimentally. It is shown that an earlier algorithm of the authors, called ITERSSS*, which allows SSS* to run in restricted memory, can also be parallelized using the above scheme.