Goofspiel

Goofspiel
Players 2+
Age range 8+
Setup time Short
Playing time Short
Random chance Low
Skill(s) required Tactics, psychology

Goofspiel, also known as The Game of Pure Strategy or GOPS, is a card game for two or more players. It was invented by Merrill Flood while at Princeton University in the 1930s,[1] and Alex Randolph describes a similar game as having been popular with the 5th Indian Army during the Second World War.[2]

The game is simple to learn and play, but has some degree of strategic depth. It is commonly used as an example of multi-stage simultaneous move game in game theory and artificial intelligence.

Game play

Goofspiel is played using cards from a standard deck of cards, and is typically a two-player game, although more players are possible. Each suit is ranked A (low), 2, ..., 10, J, Q, K (high).

  1. One suit is singled out as the "prizes"; each of the remaining suits becomes a hand for one player, with one suit discarded if there are only two players, or taken from additional decks if there are four or more. The prizes are shuffled and placed between the players with one card turned up.
  2. Play proceeds in a series of rounds. The players make "closed bids" for the top (face up) prize by selecting a card from their hand (keeping their choice secret from their opponent). Once these cards are selected, they are simultaneously revealed, and the player making the highest bid takes the competition card. Rules for ties in the bidding vary, possibilities including the competition card being discarded, or its value split between the tied players (possibly resulting in fractional scores). Some play that the current prize may "roll over" to the next round, so that two or more cards are competed for at once with a single bid card.
  3. The cards used for bidding are discarded, and play continues with a new upturned prize card.
  4. After 13 rounds, there are no remaining cards and the game ends. Typically, players earn points equal to sum of the ranks of cards won (i.e. Ace is worth one point, 2 is two points, etc., Jack being worth 11, Queen 12, and King worth 13 points). Players may agree upon other scoring schemes.

Mathematical analysis

Goofspiel (or variants of it) has been the subject of mathematical study. For example, Sheldon Ross considered the case when one player plays his cards randomly, to determine the best strategy that the other player should use.[3] Using a proof by induction on the number of cards, Ross showed that the optimal strategy for the non-randomizing player is to match the upturned card, i.e. if the upturned card is the Jack, he should play his Jack, etc. In this case, the expected final score is 59½ - 31½, for a 28-point win.[3]

The game as defined by Ross, where payoffs are point differences, was solved using linear and dynamic programming in 2012.[4]

Strategy of GOPS

Any pure strategy in this game has a simple counter-strategy where the opponent bids one rank higher, or as low as possible against the King bid. As an example, consider the strategy of matching the upturned card value mentioned in the previous section. The final score will be 78 - 13 with the King being the only lost prize.

In general, making a very low bid can be advantageous if the player has correctly guessed that the opponent is making a high bid; despite losing a (presumably high-scoring) prize, the player gains an advantage in bidding power that can last for multiple turns. In the variant in which tie bids cause prizes to accumulate, the player with a bidding advantage might make bids that are more likely to tie, knowing that he can then use his uncontested high-bid card to win the accumulated group.

References

  1. ↑ Tucker, Albert W. (1985). "The Princeton Mathematics Community in the 1930s: Merrill Flood". The Trustees of Princeton University. Retrieved 26 February 2015.
  2. ↑ Parlett, David (2000). The Penguin Encyclopedia of Card Games. Penguin. p. 393. ISBN 9780140280326.
  3. 1 2 Ross, Sheldon M. (Sep 1971). "Goofspiel -- The Game of Pure Strategy". Journal of Applied Probability (Journal of Applied Probability, Vol. 8, No. 3) 8 (3): 621–625. doi:10.2307/3212187. JSTOR 3212187.
  4. ↑ Rhoads, G. C.; Bartholdi, L. (2012). "Computer Solution to the Game of Pure Strategy". Games 3 (4): 150–156. doi:10.3390/g3040150.

External links

This article is issued from Wikipedia - version of the Monday, December 21, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.