References
- [1] CJF Cremers. “How best to beat high scores in Yahtzee: A caching structure for evaluating large recurrent functions”. MA thesis. the Netherlands: Technische Universiteit Eindhoven, 2002.
- [2] Irving L Finkel. “On the rules for the Royal Game of Ur”. In: Ancient Board Games in Perspective (2007), pp. 16–32.
- [3] James Glenn. “An optimal strategy for Yahtzee”. In: Loyola College in Maryland, Tech. Rep. CS-TR-0002 (2006).
- [4] James R Glenn. “Computer strategies for solitaire Yahtzee”. In: 2007 IEEE Symposium on Computational Intelligence and Games. IEEE. 2007, pp. 132–139.10.1109/CIG.2007.368089
- [5] Marcus Larsson and Andreas Sjöberg. “Optimal Yatzy Strategy”. In: Kungliga Tekniska Högskolan (2012).
- [6] Tom Verhoeff. Optimal solitaire Yahtzee strategies. 2000.
- [7] Clement Wood and Gloria Goddard. The Complete Book of Games. Blue Ribbon Books, 1938.
DOI: https://doi.org/10.2478/rmm-2020-0004 | Journal eISSN: 2182-1976
Language: English
Page range: 53 - 70
Published on: Sep 18, 2020
Published by: Ludus Association
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Related subjects:
© 2020 Joseph Heled, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.