kc: Simulation programming problem

[kc]

Problem: A programmer wants to investigate probabilities using simulation at a given shoe pen for a given situation using a count; for example 10,5 vs 10. Say we want to look at the probabilties when 17 additional cards have been dealt from a single deck, so 20 cards will have been dealt. Assume for the sake of argument that the programmer can simulate a truly random deal. Also say we want to look at the probalities of a Hi-Lo running count of +3 at this pen.

Question: One way of approaching this problem is to remove 2 10s and a 5 from the deck and then randomly deal 17 cards a number of times and only record the deals when the running count is exactly +3. What I'm wondering is if there is a way to force a running count of +3 after each and every random deal of 17 cards without compromising randomness.

I hope the question is clear. Responses welcome.

kc

[Norm Wattenberger]

Also, dealing 17 random cards will not work. The cards cannot be random. That must make up cards that make up real hands and they must be of the frequency of those hands that would be seen in the first 17 cards.

> Problem: A programmer wants to investigate
> probabilities using simulation at a given shoe pen for
> a given situation using a count; for example 10,5 vs
> 10. Say we want to look at the probabilties when 17
> additional cards have been dealt from a single deck,
> so 20 cards will have been dealt. Assume for the sake
> of argument that the programmer can simulate a truly
> random deal. Also say we want to look at the
> probalities of a Hi-Lo running count of +3 at this
> pen.

> Question: One way of approaching this problem is to
> remove 2 10s and a 5 from the deck and then randomly
> deal 17 cards a number of times and only record the
> deals when the running count is exactly +3. What I'm
> wondering is if there is a way to force a running
> count of +3 after each and every random deal of 17
> cards without compromising randomness.

> I hope the question is clear. Responses welcome.

> kc

[MGP]

Look up the "Subset Sum" problem