论文信息 - Another View on the SSS* Algorithm

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.

Wim Pijls | Arie de Bruin | A. Bruin | W. Pijls

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

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

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

[4] Vipin Kumar,et al. Parallel Branch-and-Bound Formulations for AND/OR Tree Search , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

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