Efficient Approximation of Backgammon Race Equities¹

Article type: Research Article

Authors: Buro, M.^{; 2}

Affiliations: Princeton, USA

Note: [1] This is a revised version of the paper delivered under the same title on June 16, 1999 on the 9th Conference on Advances in Computer Chess, in Paderborn, Germany. It will be also published in the Proceedings of that Conference.

Note: [2] NEC Research Institute, 4 Independence Way, Princeton NJ 08540, USA. Email: mic@research.nj.nec.com.

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.

DOI: 10.3233/ICG-1999-22303

Journal: ICGA Journal, vol. 22, no. 3, pp. 133-142, 1999