A game-theoretic analysis of \textit{Baccara chemin de fer} (Q2351255)

Summary: Assuming that cards are dealt with replacement from a single deck and that each of Player and Banker sees the total of his own two-card hand but not its composition, \textit{baccara} is a \(2\times 2^{88}\) matrix game, which was solved by \textit{J. G. Kemeny} and \textit{J. L. Snell} [Am. Math. Mon. 64, 465--469 (1957; Zbl 0079.35203)]. Assuming that cards are dealt without replacement from a \(d\)-deck shoe and that Banker sees the composition of his own two-card hand while Player sees only his own total, \textit{baccara} is a \(2\times 2^{484}\) matrix game, which was solved by Downton and Lockwood in 1975 for \(d=1,2,\dots,8\). Assuming that cards are dealt without replacement from a \(d\)-deck shoe and that each of Player and Banker sees the composition of his own two-card hand, \textit{baccara} is a \(2^5\times 2^{484}\) matrix game, which is solved herein for every positive integer \(d\).