SSS* = Alpha-Beta + TT

In 1979 Stockman introduced the SSS* minimax search algorithm that domi- nates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to understand, it has large memory requirements, and it is slow. This paper presents an alternate formulation of SSS*, in which it is implemented as a series of Alpha-Beta calls that use a transposition table (AB- SSS*). The reformulation solves all three perceived drawbacks of SSS*, making it a practical algorithm. Further, because the search is now based on Alpha-Beta, the extensive research on minimax search enhancements can be easily integrated into AB-SSS*. To test AB-SSS* in practise, it has been implemented in three state-of-the- art programs: for checkers, Othello and chess. AB-SSS* is comparable in performance to Alpha-Beta on leaf node count in all three games, making it a viable alternative to Alpha-Beta in practise. Whereas SSS* has usually been regarded as being entirely different from Alpha-Beta, it turns out to be just an Alpha-Beta enhancement, like null-window searching. This runs counter to published simulation results. Our research leads to the surprising result that iterative deepening versions of Alpha-Beta can expand fewer leaf nodes than iterative deepening versions of SSS* due to dynamic move re-ordering.

[1]  R. Korf,et al.  Best-First Minimax Search , 1996, Artif. Intell..

[2]  Vipin Kumar,et al.  A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures , 1983, Artif. Intell..

[3]  Alexander Reinefeld,et al.  Spielbaum-Suchverfahren , 1989, Informatik-Fachberichte.

[4]  Toshihide Ibaraki,et al.  Generalization of Alpha-Beta and SSS Search Procedures , 1986, Artif. Intell..

[5]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[6]  Alexander Reinefeld,et al.  An Improvement to the Scout Tree Search Algorithm , 1983, J. Int. Comput. Games Assoc..

[7]  T. Anthony Marsland,et al.  A Comparison of Minimax Tree Search Algorithms , 1983, Artif. Intell..

[8]  Amitava Bagchi,et al.  A Faster Alternative to SSS* with Extension to Variable Memory , 1993, Inf. Process. Lett..

[9]  Jonathan Schaeffer,et al.  A World Championship Caliber Checkers Program , 1992, Artif. Intell..

[10]  Jonathan Schaeffer,et al.  The History Heuristic and Alpha-Beta Search Enhancements in Practice , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  K. Coplan.  A SPECIAL-PURPOSE MACHINE FOR AN IMPROVED SEARCH ALGORITHM FOR DEEP CHESS COMBINATIONS , 1982 .

[12]  Hermann Kaindl,et al.  Minimax Search Algorithms With and Without Aspiration Windows , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Wim Pijls,et al.  Another View on the SSS* Algorithm , 1990, SIGAL International Symposium on Algorithms.

[14]  Donald E. Knuth,et al.  The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[15]  Judea Pearl,et al.  A Minimax Algorithm Better Than Alpha-Beta? Yes and No , 1983, Artif. Intell..

[16]  Jonathan Schaeffer,et al.  Nearly Optimal Minimax Tree Search? , 2014, ArXiv.

[17]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[18]  Wim Pijls,et al.  Searching Informed Game Trees , 1992, ISAAC.

[19]  T. A. Marsland,et al.  A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..

[20]  Aske Plaat,et al.  Solution Trees as a Basis for Game-Tree Search , 1994, J. Int. Comput. Games Assoc..

[21]  Alexander Reinefeld,et al.  Time-Efficient State Space Search , 1994, Artif. Intell..

[22]  Rajjan Shinghal,et al.  An empirical comparison of pruning strategies in game trees , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  Feng-hsiung Hsu.  Large scale parallelization of alpha-beta search: an algorithmic and architectural study , 1989 .

[24]  Jonathan Schaeffer,et al.  A New Paradigm for Minimax Search , 2014, ArXiv.

[25]  Jonathan Schaeffer,et al.  Low Overhead Alternatives to SSS , 1987, Artif. Intell..

[26]  Jonathan Schaeffer,et al.  Experiments in Search and Knowledge , 1986, J. Int. Comput. Games Assoc..