Branch & bound formulation for sequential and parallel game tree searching: preliminary results

Authors:
Laveen Kanal;Vipin Kumar
Affiliations:
The Laboratory for Pattern Analysis, Department of Computer Science, University of Maryland, College Park, MD;The Laboratory for Pattern Analysis, Department of Computer Science, University of Maryland, College Park, MD
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Year:
1981

Citing 3
Cited 3

Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM (JACM)
The design and analysis of algorithms for asynchronous multiprocessors.

The design and analysis of algorithms for asynchronous multiprocessors.

A general branch and bound formulation for understanding and synthesizing and/or tree search procedures

Artificial Intelligence
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a Branch and Bound (B&B) formulation for finding the minlmax 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 Alpha-Beta 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*.