Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Single-suit two-person card play

  • Papers
  • Published:
International Journal of Game Theory Aims and scope Submit manuscript

Abstract

We consider a two-person constant sum perfect information game, which we call theEnd Play Game, which arises from an abstraction of simple end play positions in card games of the whist family, including bridge. This game was described in 1929 by Emanuel Lasker, the mathematician and world chess champion, who called itwhistette. The game uses a deck of cards that consists of a single totally ordered suit of 2n cards. To begin play the deck is divided into two handsA andB ofn cards each, held by players Left and Right, and one player is designated as having thelead. The player on lead chooses one of his cards, and the other player after seeing this card selects one of his own to play. The player with the higher card wins a “trick” and obtains the lead. The cards in the trick are removed from each hand, and play then continues until all cards are exhausted. Each player strives to maximize his trick total, and thevalue of the game to each player is the number of tricks he takes. Despite its simple appearance, this game is quite complicated, and finding an optimal strategy seems difficult. This paper derives basic properties of the game, gives some criteria under which one hand is guaranteed to be better than another, and determines the optimal strategies and value functions for the game in several special cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adachi A, Iwata S, Kasai T (1981) Low level complexity for combinatorial games. 13th Annual ACM Symposium on Theory of Computing (Milwaukee, Wisc. 1981). ACM, New York, pp 228–237

    Google Scholar 

  2. Berlekamp E, Conway J, Guy R (1982) Winning ways, vols I and II. Academic Press

  3. Fraenkel AS, Garey MR, Johnson DS (1978) The complexity of checkers on ann ×n board, preliminary report. Proc. 19th Annual IEEE Symp. on Foundations of Computer Science (Ann Arbor, Mich 1978). IEEE Computer Society, pp 55–64

    Google Scholar 

  4. Fraenkel AS, Lichtenstein D (1981) Computing a perfect strategy forn ×n chess requires time exponential inn. J Comb Theory (Series A) 31:199–214

    Google Scholar 

  5. Gilbert JR, Lengauer T, Tarjan RE (1980) The pebbling problem is complete in polynomial space. SIAM J Computing 9:513–524

    Google Scholar 

  6. Kahn J, Lagarias JC, Witsenhausen HS (1987) Single suit two-person card play II: Domination. Preprint

  7. Kahn J, Lagarias JC, Witsenhausen HS (1987) Single suit two-person card play III: The misère game. Preprint

  8. Lasker E (1929) Encyclopedia of games, vol I, Card strategy. EP Dutton & Co, New York

    Google Scholar 

  9. Lichtenstein D, Sipser M (1980) Go is polynomial-space hard. J Assoc Comp Mach 27:393–401

    Google Scholar 

  10. Morris FL (1981) Playing disjunctive sums is polynomial space complete. Intern J Game Theory 10:195–205

    Google Scholar 

  11. Reisch S (1980) Go-bang ist PSPACE-vollständig. Acta Informatica 13:59–66

    Google Scholar 

  12. Reisch S (1981) Hex ist PSPACE-vollständig. Acta Informatica 15:167–191

    Google Scholar 

  13. Schaefer TJ (1978) On the complexity of some two-person perfect information games. J Computer Systems Science 16:185–225

    Google Scholar 

  14. Stockmeyer LJ, Chandra AK (1979) Provably difficult combinatorial games. SIAM J Computing 8:151–174

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kahn, J., Lagarias, J.C. & Witsenhausen, H.S. Single-suit two-person card play. Int J Game Theory 16, 291–320 (1987). https://doi.org/10.1007/BF01756027

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01756027

Keywords