Abstract
The alpha-beta algorithm is a common technique used for the minimax search of game trees. Because the search is ordered and serial, arranging better alternatives first makes the search efficient This paper compares the efficiency of different orderings in capture search. It was found that the most desirable method of first using the most minor piece to capture the most major one was several orders of magnitude better than the worst capture order.
Get full access to this article
View all access options for this article.