Abstract
This paper presents the history heuristic, an inexpensive way to re-order moves dynamically at interior nodes of search trees. This method is experimentally shown to decrease the running time of a chess program by 21%.
Get full access to this article
View all access options for this article.