Abstract
In k-best game-tree search the k best moves of a position are computed. In practice, k = 2 and k = 3 are frequently used settings. The note describes a k-best realisation of the alpha-beta algorithm and exhibits five different visualisations of the k-best candidates during the process of iterative deepening.
Get full access to this article
View all access options for this article.