SSS*-Like Algorithms in Constrained Memory

Article type: Research Article

Authors: Pijls, Wim | de Bruin, Arie

Affiliations: Erasmus University Rotterdam, The Netherlands

Abstract: In 1986, Ibaraki proposed a unifying framework for game-tree algorithms, GSEARCH. In general, a relatively great deal of memory is necessary for instances of this framework. In 1991, Ibaraki therefore introduced an extended framework, called RSEARCH, in which the use of memory can be controlled. In this paper, two variants, Gsearch and Rsearch, of the above frameworks are presented. Instances of these new frameworks are Maxsearch and Rmaxsearch. These are close to SSS* and our SSS-2 algorithm, but with the distinction that Rmaxsearch is an SSS*-like algorithm suitable when relatively little memory is available.

DOI: 10.3233/ICG-1993-16103

Journal: ICGA Journal, vol. 16, no. 1, pp. 18-30, 1993