A Nearly Optimal Computer Player in Multi-player Yahtzee

  title={A Nearly Optimal Computer Player in Multi-player Yahtzee},
  author={J. P. Pan},
Yahtzee is the most popular commercial dice game in the world. It can be played either by one or many players. In case of the single player version, optimal computer strategies both for maximizing the expected average score and for maximizing the probability of beating a particular score are already known. However, when it comes to the multi-player version, those approaches are far too resource intensive and thus are not able to develop an optimal strategy given current hardware. This paper… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-9 of 9 references

How best to beat high scores in Yahtzee: A caching structure for evaluating large recurrent functions

  • C.J.F. Cremers
  • Master's thesis, Fac. of Math. and CS,
  • 2002
Highly Influential
4 Excerpts

Algorithmic techniques for solving games on the example of dice game Yahtzee

  • Jakub Pawlewicz
  • PhD thesis, University of Warsaw,
  • 2009
Highly Influential
3 Excerpts

A retrograde approximation algorithm for two-player Can't Stop

  • James Glenn, Haw-ren Fang, Clyde P. Kruskal
  • In Computers and Games Workshop,
  • 2007
Highly Influential
4 Excerpts

A nearly optimal computer player in multi-player Yahtzee (full version)

  • Jakub Pawlewicz
  • http://www.mimuw.edu.pl/~pan/papers/yahtzee.pdf
  • 2010

PlayOK.com free online games (kurnik)

  • Marek Futrega
  • http://www.playok.com/
  • 2007
1 Excerpt

An optimal strategy for Yahtzee

  • James Glenn
  • Technical report, Department of Computer Science…
  • 2006
2 Excerpts

Similar Papers

Loading similar papers…