Single-suit two-person card play

DOI10.1007/BF01756027zbMath0628.90094WikidataQ104377100 ScholiaQ104377100MaRDI QIDQ1093570

H. S. Witsenhausen, Jeffrey C. Lagarias, Jeffry Kahn

Publication date: 1987

Published in: International Journal of Game Theory (Search for Journal in Brave)

zbMATH Keywords

End Play Gametwo-person constant sum perfect information game

Mathematics Subject Classification ID

2-person games (91A05)

Related Items (4)

Single-suit two-person card play ⋮ Strategies in competing subset selection ⋮ Competitive subset selection with two agents ⋮ Combinatorial games modeling seki in Go

Cites Work

• Unnamed Item
• Single-suit two-person card play
• Computing a perfect strategy for nxn chess requires time exponential in n
• Playing disjunctive sums is polynomial space complete
• On the complexity of some two-person perfect-information games
• Single-Suit Two-Person Card Play III. The Misère Game
• Provably Difficult Combinatorial Games
• GO Is Polynomial-Space Hard
• The Pebbling Problem is Complete in Polynomial Space

This page was built for publication: Single-suit two-person card play