Of the many minimax algorithms, SSS* consistently searches the smallest game trees. Its success can be attributed to the accumulation and use of information acquired while traversing the tree, allowing a best first search strategy. The main disadvantage of SSS* is its excessive storage requirements. This paper describes a class of search algorithms which, though based on the popular alpha-beta ...