Download:
|
by Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie De Bruin
http://theory.lcs.mit.edu/~plaat/tr9417.ps
Add To MetaCart
Abstract:
In 1979 Stockman introduced the SSS * minimax search algorithm that dominates 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 (ABSSS *). 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-theart 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
Citations
|
472
|
Heuristics: Intelligent Search Strategies for Computer Problem Solving
– Pearl
- 1984
|
|
193
|
An analysis of Alpha-Beta Pruning
– Knuth, Moore
- 1975
|
|
85
|
A world championship caliber checkers program
– SCHAEFFER, CULBERSON, et al.
- 1992
|
|
79
|
The History Heuristic and Alpha-Beta Search Enhancements in Practice
– Schaeffer
- 1989
|
|
78
|
A minimax algorithm better than alpha-beta
– Stockman
- 1979
|
|
57
|
A comparison of minimax tree search algorithms
– Campbell, A
- 1983
|
|
57
|
A Review of Game-Tree Pruning
– Marsland
- 1986
|
|
54
|
An Improvement of the Scout Tree Search Algorithm
– Reinefeld
- 1983
|
|
53
|
Experiments in Search and Knowledge
– Schaeffer
- 1986
|
|
49
|
Low overhead alternatives to SSS
– Marshland, Reinefeld, et al.
- 1987
|
|
45
|
Large Scale Parallelization of Alpha-Beta Search: An Algorithmic and Architectural Study with Computer Chess
– Hsu
- 1990
|
|
43
|
A minimax algorithm better than alpha-beta? yes and no
– Roizen, Pearl
- 1983
|
|
37
|
An empirical comparison of pruning strategies in game trees
– Muszycka, Shinghal
- 1985
|
|
26
|
Generalization of alpha-beta and SSS* search procedures
– Ibaraki
- 1986
|
|
26
|
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures
– Kumar, Kanal
- 1983
|
|
25
|
Time-efficient state space search
– Reinefeld, Ridinger
- 1994
|
|
24
|
A special-purpose machine for an improved search algorithm for deep chess combinations
– Coplan
- 1981
|
|
24
|
Helmut Horacek. Minimax search algorithms with and without aspiration windows
– Kaindl, Shams
- 1991
|
|
23
|
A new paradigm for minimax search
– Plaat, Schaeffer, et al.
- 1994
|
|
22
|
Spielbaum Suchverfahren. Informatik-Fachberichte 200
– Reinefeld
- 1989
|
|
21
|
Wim Pijls, and Aske Plaat. Solution trees as a basis for game-tree search
– Bruin
- 1994
|
|
21
|
Another view on the SSS* algorithm
– Pijls, Bruin
- 1990
|
|
20
|
Algorithms for the parallel search of game trees
– Campbell
- 1981
|
|
20
|
Solution trees as a unifying concept for game tree algorithms
– Pijls, Bruin, et al.
- 1995
|
|
18
|
Searching informed game trees
– Pijls, Bruin
- 1992
|
|
18
|
Nearly optimal minimax tree search
– Plaat, Schaeffer, et al.
- 1994
|
|
15
|
A faster alternative to SSS* with extension to variable memory. Information processing letters, 47:209--214
– Bhattacharya, Bagchi
- 1993
|
|
12
|
Unified recursive schemes for search in game trees
– Bhattacharya, Bagchi
- 1990
|
|
11
|
Solution trees as a basis for game tree search
– Bruin, Pijls, et al.
- 1994
|
|
9
|
Best-first minimax search: First results
– Korf, Chickering
- 1993
|
