Solving the Dice Game Pig : an introduction to dynamic programming and value iteration

For such a simple dice game, one might expect a simple optimal strategy, such as in Blackjack (e.g., “stand on 17” under certain circumstances, etc.). As we shall see, this simple dice game yields a much more complex and intriguing optimal policy. In our exploration of Pig we will learn about dynamic programming and value iteration, covering fundamental concepts of reinforcement learning techniques. For the interested reader, there is a companion Game of Pig website that features an optimal Pig computer player, VRML visualizations of the optimal policy, and information about Pig and its variants.