Quote Originally Posted by Cacarulo View Post
I'll give you an idea of ??what I do. Maybe this can help you.
Let's use as an example a deck of 52 cards and the unbalanced count of tens (1 1 1 1 1 1 1 1 1 -2).
1) Remove an ace from the pack (which is the ace the dealer receives)

The other array is used to know the frequency of each TC.
Cac
I store my data in a list.

If I construct a list with a specific pen and rc for the insurance count it will contain either 0 or 1 entries (elems) depending upon rc. If elems = 0, probRC = 0.

This is what I presently do:
Code:
list = new subsetList (inputCount, decks, pen, rc, specificRem);
list->getProbRC(rc, probRC, pRank);
long elems = list->elems;
delete list;
list = NULL;
What I used to do was construct a list with all rc possible to use. For more complicated counts too much data crashes program.
For the insurance count where pen = 26 there are 17 entries in the list and sum of probRC of each entry = 1. For any count sum of probRC of entries in list = 1 regardless of number of entries.

What I could do is something like this:
Code:
list = new subsetList (inputCount, decks, pen, specificRem);

for (rc = minValue; rc <= maxValue; ++rc)
     list->getProbRC(rc, probRC, pRank);

long elems = list->elems;
I can relate to probRC, but probTC? (relative to simple insurance count)

k_c