The Fundamental Theorem of Card Counting with applications to Trente-et-Quarante and Baccarat
- 187 Downloads
The Fundamental Theorem of Card Counting is a unifying principle for the analysis of card games of chance which are characterized by sampling without replacement. The Theorem says (roughly) the “spread” in distribution of player expectations for partially depleted card packs increases with depletion of the card pack. Furthermore, average player expectation is non-decreasing (increasing under suitable hypotheses) with increasing depletion.
The Theorem is used to prove that significant favorable strategies based on card counting do not exist for Trente-et-Quarante or for “tie” bets in Nevada Baccarat. This is in sharp contrast with previous results for Blackjack and for Nevada Baccarat side bets on natural eight and natural nine.
KeywordsEconomic Theory Game Theory Sharp Contrast Fundamental Theorem Card Game
Unable to display preview. Download preview PDF.
- Boll, M.: La Chance et les Jeux de Hasard. Librarie Larousse, Paris 1936.Google Scholar
- Epstein, R. A.: The Theory of Gambling and Statistical Logic. Academic Press, New York 1967.Google Scholar
- Poisson, D.: Mémoire sur L'Advantage du Banquier au Jeu de Trente et Quarante. Annales de Mathematiques Pures et Appliqueés (“Gergonne's Journal”), Tom. XVI n∘ VI, Décembre 1825, 173–208.Google Scholar
- Thorp, E. O.: A Favorable Strategy for Twenty One. Proceedings of the National Academy of Sciences47, 110–12, 1961.Google Scholar
- —: Beat the Dealer. Random House, New York 1962; revised, 1966.Google Scholar
- —: Optimal Gambling Systems for Favorable Games. Review of the International Statistical Institute37:3, 273–93, 1969.Google Scholar
- —: Probabilities and Strategies for the Game of Faro. To appear, J. Am. Stat. Assn., 1973.Google Scholar
- Thorp, E. O., andW. Walden: A Winning Bet in Nevada Baccarat. Journal of the American Statistical Association61, Part I, 313–28, 1966.Google Scholar
- —: The Solution of Games by Computer. Prebook.Google Scholar