Computer Science Faculty Publications Computer Science 2004 Optimal Play of the Dice Game Pig Todd W. Neller Gettysburg College Clifton G.M. Presser Gettysburg College Follow this and additional works at: https://cupola.gettysburg.edu/csfac Part of the Computer Sciences Commons Share feedback about the accessibility of this item. Neller, Todd W. and Clifton G.M. Presser. "Optimal Play of the Dice Game Pig," The UMAP Journal 25.1 (2004), 25-47. This is the publisher's version of the work. This publication appears in Gettysburg College's institutional repository by permission of the copyright owner for personal use, not for redistribution. Cupola permanent link: https://cupola.gettysburg.edu/csfac/4 This open access article is brought to you by The uC pola: Scholarship at Gettysburg College. It has been accepted for inclusion by an authorized administrator of The uC pola. For more information, please contact
[email protected]. Optimal Play of the Dice Game Pig Abstract The bjo ect of the jeopardy dice game Pig is to be the first player to reach 100 points. Each player's turn consists of repeatedly rolling a die. After each roll, the player is faced with two choices: roll again, or hold (decline to roll again). • If the player rolls a 1, the player scores nothing and it becomes the opponent's turn. • If the player rolls a number other than 1, the number is added to the player's turn total and the player's turn continues. • If the player holds, the turn total, the sum of the rolls during the turn, is added to the player's score, and it becomes the opponent's turn.