SSS*-Like Algorithms in Constrained Memory

Wim Pijls, Arie de Bruin · ICGA Journal · 1993

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,

Read the paper · More papers on PaperTik