Single-suit two-person card play (Q1093570): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a perfect strategy for nxn chess requires time exponential in n / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pebbling Problem is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-suit two-person card play / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Suit Two-Person Card Play III. The Misère Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing disjunctive sums is polynomial space complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably Difficult Combinatorial Games / rank
 
Normal rank

Latest revision as of 12:58, 18 June 2024

scientific article
Language Label Description Also known as
English
Single-suit two-person card play
scientific article

    Statements

    Single-suit two-person card play (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    We consider a two-person constant sum perfect information game, which is called the End 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 it whistette. 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 hands A and B of n cards each, help by players Left and Right, and one player is designated as having the lead. 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 cards 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 the value 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.
    0 references
    0 references
    two-person constant sum perfect information game
    0 references
    End Play Game
    0 references
    0 references