bjstrat letters


Solving a problem by combinatorial analysis is always better than employing a simulation methodology to arrive at a solution if combinatorial analysis is reasonably possible. Combinatorial analysis always arrives at an exact answer for the parameters used since it accounts for all possibilities. Simulation arrives at an estimate and needs to use a method to account for enough of the possibilities to be relevant. However, in cases where employing combinatorial analysis is so difficult as to be intractable then simulation is the only viable alternative.

Blackjack and combinatorial analysis

It's possible to compute expected values in blackjack for any shoe composition and common rules. The main problem is creating a program that executes quickly enough to be reasonably useful. Composition Dependent Combinatorial Analyzer (cdca) is the online version of such a program. However, what if we want an overall evaluation of a blackjack game dealt to a shuffle point and repeated over and over again? Our combinatorial analyzer can compute exact values for any given single composition but how can it be employed to display expected values for repetition? The answer is to simulate dealing of a blackjack game and use the combinatorial analyzer to compute exact expected values for each shoe composition as it arises in the simulation. Simulating dealing is the only viable solution because attempting to enumerate all of the intracacies of dealing a blackjack game to account for all possibe drawing sequences and eliminating sequences that aren't possible is just not feasible.


Copyright 2010 (
All rights reserved.