Computer Strategies for Solitaire Yahtzee
Glenn, J.R.
Dept. of Comput. Sci., Loyola Coll.;
This paper appears in: Computational Intelligence and Games, 2007. CIG 2007. IEEE Symposium on
Publication Date: 1-5 April 2007
On page(s): 132-139
Location: Honolulu, HI,
ISBN: 1-4244-0709-5
INSPEC Accession Number: 9507296
Digital Object Identifier: 10.1109/CIG.2007.368089
Current Version Published: 2007-06-04
Abstract
Solitaire Yahtzee has been solved completely. However, the optimal strategy is not one a human could practically use, and for computer play it requires either a very large database or significant CPU time. We present some refinements to the techniques used to solve solitaire Yahtzee and give a method for analyzing other solitaire strategies and give some examples of this analysis for some non-optimal strategies, including some produced by evolutionary algorithms
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
