This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
Search
Skip to Search Results-
1995
de Bruin, Arie, Plaat, Aske, Schaeffer, Jonathan, Pijls, Wim
Technical report TR95-15. This paper has three main contributions to our understanding of fixed-depth minimax search: (A) A new formulation for Stockman's SSS* algorithm, based on Alpha-Beta, is presented. It solves all the perceived drawbacks of SSS, finally transforming it into a practical...
-
1994
Schaeffer, Jonathan, Pijls, Wim, de Bruin, Arie, Plaat, Aske
Technical report TR94-18. This paper introduces a new paradigm for minimax game-tree search algorithms. MT is a memory-enhanced version of Pearl's Test procedure. By changing the way MT is called, a number of best-first game-tree search algorithms can be simply and elegantly constructed...
-
1994
de Bruin, Arie, Pijls, Wim, Schaeffer, Jonathan, Plaat, Aske
Technical report TR94-19. 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 minimal tree Since real-life minimax trees aren't uniform, the exact size of this tree...
-
1994
Schaeffer, Jonathan, Pijls, Wim, Plaat, Aske, de Bruin, Arie
Technical report TR94-17. 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...