1992
Searching informed game trees
Publication
Publication
Well-known algorithms for the evaluation of the minimax function in game trees are alpha-beta and SSS*. An improved version of SSS* is SSS-2. 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. Extended versions of these algorithms are presented. The subset of nodes which is visited during execution of each algorithm is characterised completely.
Additional Metadata | |
---|---|
, | |
hdl.handle.net/1765/1490 | |
Organisation | Erasmus School of Economics |
Pijls, W., & de Bruin, A. (1992). Searching informed game trees. Retrieved from http://hdl.handle.net/1765/1490 |