Originally Posted by
Cacarulo
Take your time, I'm not in a hurry.
We both agree that there are 12 subsets that make up -13. Regarding the difference between 4.054326 and 4.028648, I would have to check my code since I haven't touched it for more than 20 years.
As I told you before, I am not 100% sure that my number is correct. The algorithm was never compared to other researchers as no one was interested in subset generation at the time.
What my algorithm does is to generate a subset given the following data: RC, remaining cards, and a card counting system. Before generating it I have the possibility to remove the cards that I want. Although the algorithm works perfectly, it does not mean that what it generates is correct.
For checking purposes and whenever you have time, could you pass me your generated subset with an Ace removed for an RC of +1 and 38 cards remaining? This would be SD.
Thank you.
Sincerely,
Cac
Here are the rank probs I get for single deck, RC=+1, 38 cards remaining, 1 ace specifically removed
If you want number of rank just multiply each rank prob by 38.
Code:
Count tags {1,-1,-1,-1,-1,-1,0,0,0,1}
Decks: 1
Cards remaining: 38
Initial running count (full shoe): 0
Running count: 1
Specific removals (1 - 10): {1,0,0,0,0,0,0,0,0,0}
Subgroup removals: None
Number of subsets for above conditions: 6
Prob of running count 1 with above removals from 1 deck: 0.11848
p[1] 0.062504 p[2] 0.073909 p[3] 0.073909 p[4] 0.073909 p[5] 0.073909
p[6] 0.073909 p[7] 0.078199 p[8] 0.078199 p[9] 0.078199 p[10] 0.33336
Press any key to continue:
It helps me to solve a simple problem and then work to apply to other problems. Below is data for the simplest subset (1 card) dealt from 2 decks with various specific removals:
Code:
2 decks, HiLo
Cards Specific
Remaining RC Removals Rank Probs Prob of Subset
1 -1 none p[1] 0 p[2] 0.2 p[3] 0.2 p[4] 0.2 p[5] 0.2 0.38462
p[6] 0.2 p[7] 0 p[8] 0 p[9] 0 p[10] 0
1 -1 A p[1] 0 p[2] 0.2 p[3] 0.2 p[4] 0.2 p[5] 0.2 0.38835
p[6] 0.2 p[7] 0 p[8] 0 p[9] 0 p[10] 0
1 -1 A,7 p[1] 0 p[2] 0.2 p[3] 0.2 p[4] 0.2 p[5] 0.2 0.39216
p[6] 0.2 p[7] 0 p[8] 0 p[9] 0 p[10] 0
1 -1 A,7,T p[1] 0 p[2] 0.2 p[3] 0.2 p[4] 0.2 p[5] 0.2 0.39604
p[6] 0.2 p[7] 0 p[8] 0 p[9] 0 p[10] 0
1 -1 7,T p[1] 0 p[2] 0.2 p[3] 0.2 p[4] 0.2 p[5] 0.2 0.39216
p[6] 0.2 p[7] 0 p[8] 0 p[9] 0 p[10] 0
1 -1 2 p[1] 0 p[2] 0.17949 p[3] 0.20513 p[4] 0.20513 p[5] 0.20513 0.37864
p[6] 0.20513 p[7] 0 p[8] 0 p[9] 0 p[10] 0
______________________________________________________________________________________________________
1 0 none p[1] 0 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.23077
p[6] 0 p[7] 0.33333 p[8] 0.33333 p[9] 0.33333 p[10] 0
1 0 A p[1] 0 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.23301
p[6] 0 p[7] 0.33333 p[8] 0.33333 p[9] 0.33333 p[10] 0
1 0 A,7 p[1] 0 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.22549
p[6] 0 p[7] 0.30435 p[8] 0.34783 p[9] 0.34783 p[10] 0
1 0 A,7,T p[1] 0 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.22772
p[6] 0 p[7] 0.30435 p[8] 0.34783 p[9] 0.34783 p[10] 0
1 0 7,T p[1] 0 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.22549
p[6] 0 p[7] 0.30435 p[8] 0.34783 p[9] 0.34783 p[10] 0
1 0 2 p[1] 0 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.23301
p[6] 0 p[7] 0.33333 p[8] 0.33333 p[9] 0.33333 p[10] 0
_______________________________________________________________________________________________________
1 1 none p[1] 0.2 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.38462
p[6] 0 p[7] 0 p[8] 0 p[9] 0 p[10] 0.8
1 1 A p[1] 0.17949 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.37864
p[6] 0 p[7] 0 p[8] 0 p[9] 0 p[10] 0.82051
1 1 A,7 p[1] 0.17949 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.38235
p[6] 0 p[7] 0 p[8] 0 p[9] 0 p[10] 0.82051
1 1 A,7,T p[1] 0.18421 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.37624
p[6] 0 p[7] 0 p[8] 0 p[9] 0 p[10] 0.81579
1 1 7,T p[1] 0.2 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.38235
p[6] 0 p[7] 0 p[8] 0 p[9] 0 p[10] 0.8
1 1 2 p[1] 0.2 p[2] 0 p[3] 0 p[4] 0 p[5] 0 0.38835
p[6] 0 p[7] 0 p[8] 0 p[9] 0 p[10] 0.8
Finally you asked why I do not include up card as a specific removal when generating indexes. I agree that would be better but my CA computes EVs for an input hand comp for all up cards. When I went into generating indexes I adapted to my CA as is. I do include an ace up card as a specific removal as well as hand comp when generating insurance indexes, however.
Basically what I do is to weight each of the possible count subsets by their probabilities. There was a previous thread that asked about the probability of a running count at a given pen. I added this page to my website and it includes how I compute subset probs. I use these to compute rank probs. http://www.bjstrat.net/RC_prob.html
It would be nice to somehow simplify this method somehow though. Maybe yours could.
k_c
Bookmarks