Abstract
This paper uses dynamic programming and branch-and-bound methods to determine optimal strategies for the game of darts.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
*Permanent address: 2 Hillside Crescent, Stanstead Abbotts, Herts SG12 8BQ, U.K.
Rights and permissions
About this article
Cite this article
Kohler, D. Optimal Strategies for the Game of Darts. J Oper Res Soc 33, 871–884 (1982). https://doi.org/10.1057/jors.1982.191
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1982.191