Abstract
Minimizing windows demonstrably improves the alpha-beta tree-search algorithm. This paper, after stating an enhanced version of the NegaC* search, operationally compares it to three other algorithms. In the comparison the enhancement turns out to have several favourable features.
Get full access to this article
View all access options for this article.