Another view on the SSS* algorithm
A new version of the SSS* algorithm for searching game trees is presented. This algorithm is built around two recursive procedures. It finds the minimax value of a game tree by first establishing an upper bound to this value and then successively trying in a top down fashion to tighten this bound until the minimax value has been obtained.
This approach has several advantages, most notably that the algorithm is more perspicuous. Correctness and several other properties of SSS* can now more easily be proven. As an example we prove Pearl's characterization of the nodes visited by SSS* [P1].
Unable to display preview. Download preview PDF.
- [Ib2]T. Ibaraki, Searching Minimax Game Trees under Memory Space Constraint, to appear.Google Scholar
- [KK1]V. Kumar and L.N. Kanal, A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures, Artificial Intelligence 21 (1983) 179–198Google Scholar
- [KK2]V. Kumar and L.N. Kanal, Parallel Branch and Bound Formulations for AND/OR Tree Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol PAMI-6 no. 6, november 1984.Google Scholar
- [PB]W. Pijls and A. de Bruin, Another view on the SSS* algorithm., Report EUR-CS-90-01, Erasmus University Rotterdam.Google Scholar
- [Pl]I. Roizen and J. Pearl, A Minimax Algorithm Better than Alpha-Beta? Yes and No. Artificial Intelligence 21 (1983) 199–220.Google Scholar