{"type":"ScholarlyArticle","title":"Branch & Bound Formulation for Sequential and Parallel Game Tree Searching: Preliminary Results","authors":[{"name":"Laveen N. Kanal","slug":"laveen-n-kanal","given":"Laveen N.","family":"Kanal","affiliation":""},{"name":"Vipin Kumar","slug":"vipin-kumar","given":"Vipin","family":"Kumar","affiliation":""}],"abstract":"In this paper we present a Branch and Bound (B&B} formulation for finding the minimax value of a game tree and show, that in case a subset with the best bound is chosen for branching, the resulting algorithm is identical to the SSS* algorithm which Stockman [1) has shown to be better than the AlphaBeta algorithm for game tree searching. We propose parallel implementations of B&B search for the minimax evaluation of game trees which lead to a parallel implementation of SSS*. The Branch and Bound approach provides a unified way of formulating and analyzing tree searching algorithms such as SSS* and Alpha-Beta. Viewing SSS* this way, its correctness proof is much easier than given in Stockman, as is a correctness proof for parallel implementations of SSS*.","doi":null,"url":"https://ijcai.org/proceedings/1981/106","pdf":"https://ijcai.org/proceedings/1981/0106.pdf","markdown":"https://ijcai.org/proceedings/1981/106.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/106","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Search","track":"Search","number":106,"pages":{"first":569,"last":570},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}