Card Counting

  • N. Richard Werthamer


The analysis in Chap. 7 of Optimal Basic Strategy considered only the round immediately following a shuffle, so that the first card drawn had value j with likelihood d 0(j). But for subsequent rounds, deeper into the pack, the distribution of the remaining cards varies and so do the likelihoods d(j).


Expected Return True Count Hermite Expansion Counting Vector Invariance Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Griffin, Peter A., “The Theory of Blackjack", Huntington Press, 6th edition, 1999Google Scholar
  2. Shores, Thomas S., “Applied Linear Algebra and Matrix Analysis”, Springer 2007MATHCrossRefGoogle Scholar
  3. Thorp, Edward O., “Does Basic Strategy Have the Same Expectation for Each Round?”, in Vancura, O., J.A. Cornelius, and W.R. Eadington (eds.), “Finding the Edge: Mathematical Analysis of Casino Games”, University of Nevada, Reno, 2000Google Scholar
  4. Vancura, Olaf, and Ken Fuchs, “Knock-Out Blackjack", Huntington Press, 1998Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.University of New YorkNew YorkUSA

Personalised recommendations