Abstract
Some commercial chess programs allow to compute not only the best move but also the k best moves for each position. Most frequently used are k = 2 and k = 3. Unfortunately, sometimes the moves are too similar in such a k-best list, or otherwise stated they do not discriminate among plans. A scheme examining the similarity and eliminating move proposals that are too similar is suggested. A simple approach dealing with this problem is presented.
Get full access to this article
View all access options for this article.