197 citations · 213 across the 6 of their papers we have counts for
3 papers · 2 filters
Nearly Optimal Minimax Tree Search?
Aske Plaat, Jonathan Schaeffer, Wim Pijls +1
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called…
SSS* = Alpha-Beta + TT
Aske Plaat, Jonathan Schaeffer, Wim Pijls +1
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 i…
A New Paradigm for Minimax Search
Aske Plaat, Jonathan Schaeffer, Wim Pijls +1
This paper introduces a new paradigm for minimax game-tree search algo- rithms. MT is a memory-enhanced version of Pearls Test procedure. By changing the way MT is called, a number…