Searching informed game trees
Well-known algorithms for the evaluation of the minimax function in game trees are alpha-beta [Kn] and SSS* [S t]. An improved version of SSS* is SSS-2 [Pij1]. All these algorithms don't use any heuristic information on the game tree. In this paper the use of heuristic information is introduced into the alpha-beta and the SSS-2 algorithm. The subset of nodes which is visited during execution of each algorithm is characterised completely.
Unable to display preview. Download preview PDF.
- [Ba]G. M. Baudet, On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence 10 (1978), pp 173–199.Google Scholar
- [Prl]I.Roizen and J. Pearl, A Minimax Algorithm Better than Alpha-Beta? Yes and No, Artificial Intelligence 21 (1983), pp 199–220.Google Scholar
- [Pij1]W. Pijls and A. de Bruin, Another view on the SSS * algorithm, in: Algorithms, Proceedings International Symposium SIGAL '90, Tokyo, August 1990.Google Scholar
- [Pij2]W. Pijls and A. de Bruin, Searching informed game trees, Report EUR-CS-92-02, Department Computer Science, Erasmus University Rotterdam.Google Scholar
- [S t]