Hi peterlee,
I'd like to offer an example using CA that may help clarify this topic. For the purposes of this example, I’ll apply the following rules:
6D, S17, DOA, DAS, SPA1, SPL3, LS,
along with a fixed,
total-dependent basic strategy. Under these conditions, the
off-the-top expected value (EV) of the game is:
EV = -0.3317035785
Now, consider the effect of removing a single, randomly selected card. What impact does this have on the expected value?
We know that the card removed could be any rank from Ace to Ten (where Ten also represents J, Q, and K).
Let’s examine the EV associated with removing
each individual card, assuming we know in advance which one is removed:
- EV [A] = -0.4245165255
- EV [2] = -0.2619103255
- EV [3] = -0.2476875354
- EV [4] = -0.2170750840
- EV [5] = -0.1853267626
- EV [6] = -0.2562006321
- EV [7] = -0.2912666188
- EV [8] = -0.3431801739
- EV [9] = -0.3742086172
- EV [T] = -0.4276935613
Since we do
not know in advance which card will be removed, and each rank appears
24 times in a 312-card shoe (6 decks), the probability of removing any given rank is
1/13.
To determine the
average expected value, we compute the weighted mean across all possible ranks:
EV = (-0.4245165255 - 0.2619103255 - 0.2476875354 - 0.2170750840 - 0.1853267626 - 0.2562006321 - 0.2912666188 - 0.3431801739 - 0.3742086172 - 0.4276935613*4) / 13 = -0.3317035785
This result is identical to the off-the-top EV, confirming that removing a
random card from the shoe does not change the overall expected value.
This type of analysis can also be extended to the removal of
multiple cards, following a similar probabilistic approach.
Hope this helps.
Sincerely,
Cac
Bookmarks