Rules of snake eyes game, Game Theory

Rules of Snake Eyes (small variation on game called Craps in USA)

Player rolls two dice.

On the first roll if the total of the dice is

2 (snake eyes): player wins and receive 2 points

7 or 11: player wins and the player receives 1 point

3 or 12: player's loses and the House (the computer) receives 2 points

4, 5, 6, 8, 9, 10: this total becomes your possible points that you will receive if you win. To win, you continue to roll the dice until you roll your possible points value a second time. However if you throw a total of 7 before throwing  your possible points value, you lose and the House receives 2 points.   Rolling a total which is not equal to 7 or your possible points value in these subsequent rolls has no effect on the game, you simply roll again.

In the screen shot on the next page, the player rolls a total of 4, so rolls again and luckily rolls a 4 and so wins. In the next game, rolls a total of 4 (pure coincidence!) and then has to do successive rolls until rolls a 4 and so now has 8 points total.

1108_Rules of Snake Eyes Game.png

Posted Date: 2/23/2013 8:10:08 AM | Location : United States







Related Discussions:- Rules of snake eyes game, Assignment Help, Ask Question on Rules of snake eyes game, Get Answer, Expert's Help, Rules of snake eyes game Discussions

Write discussion on Rules of snake eyes game
Your posts are moderated
Related Questions
Computer Game Zenda This game was invented by James Andreoni and Hal Varian; see their article, "Pre-Play Contracting in the Prisoners 'Dilemma".The paper also contains some co

1.a.out 2 1 Here is the grid that has been generated: 1 1 1 0 0 0 0 0 1 1 0 1 0 0 1 1 1 1 0 0 1 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 0 1 0 1 1 0 1 0 1 1 1 0

the first three words are ''''the boys'' down''''. what are the last three words?

In econometric theory two possibie situations of identifiability can arise: Equation under,consideration is identified or not identified: 1) Equation is under-identified-

Rollback (often referred to as backward induction) is an iterative method for solving finite in depth kind or sequential games. First, one determines the optimal strategy of the pl

In many cases we are interested in only one (or a few) of the equations of the model and attempts to measure its parameters statistically without a complete knowledge of the entire

Scenario To determine who is needed to try to to the nightly chores, 2 youngsters simultaneously build one among 3 symbols with their fists - a rock, paper, or scissors. straigh

An outcome of a game is Pareto dominated if another outcome would build a minimum of one player at an advantage while not hurting the other player. That is, another outcome is weak

Normal 0 false false false EN-US X-NONE X-NONE

please compute this number 885 for the swertres lotto game.