Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
Year
Collections
Languages
Item type
-
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...
1 - 1 of 1