{"type":"ScholarlyArticle","title":"Searching Game Trees in Parallel Using SSS","authors":[{"name":"Subir Bhattacharya","slug":"subir-bhattacharya","given":"Subir","family":"Bhattacharya","affiliation":"Computer Aided Management Centre Indian Institute of Management Calcutta P.O. Box 16757 , Calcutta - 700 027 , INDIA"},{"name":"Amitava Bagchi","slug":"amitava-bagchi","given":"Amitava","family":"Bagchi","affiliation":"Computer Aided Management Centre Indian Institute of Management Calcutta P.O. Box 16757 , Calcutta - 700 027 , INDIA"}],"abstract":"PARSSS* is a parallel fonnulation 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 infonnation 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.","doi":null,"url":"https://ijcai.org/proceedings/1989/7","pdf":"https://ijcai.org/proceedings/1989/0007.pdf","markdown":"https://ijcai.org/proceedings/1989/7.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/7","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Tools","track":"Tools","number":7,"pages":{"first":42,"last":46},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Bhattacharya and Bagchi, 1986] Subir Bhattacharya and A. Bagchi. Making best use of available memory when searching game trees. Proc. AAAI-86, pp. 163- 167.","title":"Making best use of available memory when searching game trees","authors":"Subir Bhattacharya, A Bagchi","year":null,"venue":"Proc. AAAI-86","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ferguson and Korf, 1988] C. Ferguson and R.E. Korf. Distributed tree search and its application to Alpha- Beta pruning. Proc. AAAI-88, pp. 128-132.","title":"Distributed tree search and its application to Alpha-Beta pruning","authors":"C Ferguson, R E Korf","year":null,"venue":"Proc. AAAI-88","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Finkel and Fishburn, 1982] R.D. Finkel and J.P. Fishburn. Parallelism in Alpha-Beta search. Artificial Intelligence, Vol. 19, 1982, pp. 89-106.","title":"Parallelism in Alpha-Beta search","authors":"R D Finkel, J P Fishburn","year":"1982","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Kumar et al., 1988] Vipin Kumar, K. Ramesh and V. Nageshwara Rao. Parallel best-first search of state- space graphs: a summary of results. Proc . AAAI-88, pp. 122-127.","title":"Parallel best-first search of statespace graphs: a summary of results","authors":"K Vipin Kumar, V Nageshwara Ramesh, Rao","year":null,"venue":"Proc . AAAI-88","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Leifkar and Kanal, 1985] D.B. Leifkar and L.N. Kanal. A hybrid SSS*/Alpha-Beta algorithm for parallel search of game trees. Proc. /JCAI-85, pp. 1044 -1046.","title":"A hybrid SSS*/Alpha-Beta algorithm for parallel search of game trees","authors":"D B Leifkar, L N","year":null,"venue":"Proc. /JCAI","doi":null,"url":null,"internal_url":"/proceedings/1985/211"},{"position":6,"raw":"[Pearl, 1984] J. Pearl. Heuristics : Intelligent Search Strategies for Computer Problem Solving. Addison- Wesley, 1984.","title":"Heuristics : Intelligent Search Strategies for Computer Problem Solving","authors":"J Pearl","year":"1984","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Rao et al, 1987] Nageshwara Rao, V. Kumar and K. Ramesh . A parallel implementation of Iterative Deepening-A* . Proc. AAAI-87, pp. 133-138.","title":"A parallel implementation of Iterative Deepening-A","authors":"Rao","year":"1987","venue":"Proc. AAAI-87","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Stockman, 1979] G. Stockman. A minimax algorithm better than Alpha-Beta ? Artificial Intelligence, Vol. 12, 1979, pp. 179-196. ..","title":"A minimax algorithm better than Alpha-Beta","authors":"G Stockman","year":"1979","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}