Open Access

Stay in Command: Optimal Play for Two Person Generala

   | Sep 18, 2020

Cite

[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.Search in Google Scholar

[2] Irving L Finkel. “On the rules for the Royal Game of Ur”. In: Ancient Board Games in Perspective (2007), pp. 16–32.Search in Google Scholar

[3] James Glenn. “An optimal strategy for Yahtzee”. In: Loyola College in Maryland, Tech. Rep. CS-TR-0002 (2006).Search in Google Scholar

[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.368089Search in Google Scholar

[5] Marcus Larsson and Andreas Sjöberg. “Optimal Yatzy Strategy”. In: Kungliga Tekniska Högskolan (2012).Search in Google Scholar

[6] Tom Verhoeff. Optimal solitaire Yahtzee strategies. 2000.Search in Google Scholar

[7] Clement Wood and Gloria Goddard. The Complete Book of Games. Blue Ribbon Books, 1938.Search in Google Scholar

eISSN:
2182-1976
Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Mathematics, General Mathematics