Abstract
This article presents efficient equity approximations for backgammon races based on statistical analyses. In conjunction with a 1-ply search the constructed evaluation functions allow a program to play short races almost perfectly with regard to checker-play as well as doubling cube handling. Moreover, the evaluation can naturally be extended to long races without losing much accuracy.
Get full access to this article
View all access options for this article.