no code implementations • 11 Feb 2017 • Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
The crucial step is the realization that transposition tables contain so-called solution trees, structures that are used in best-first search algorithms like SSS*.
no code implementations • 7 May 2015 • Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
Most practitioners use a variant of the Alpha-Beta algorithm, a simple depth-first pro- cedure, for searching minimax trees.
1 code implementation • 5 Apr 2014 • Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
This paper introduces a new paradigm for minimax game-tree search algo- rithms.
no code implementations • 5 Apr 2014 • Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
Empirical evidence shows that in all three games, enhanced Alpha-Beta search is capable of building a tree that is close in size to that of the minimal graph.
no code implementations • 5 Apr 2014 • Aske Plaat, Jonathan Schaeffer, Wim Pijls, Arie de Bruin
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.
