Probability that someone in a 10 handed game is dealt AA

[BruceZ]

[ QUOTE ]
I believe it is much much more complicated than that. I have yet to see a simple solution.


[/ QUOTE ]

See below!

6/C(52,2) * 10 - 1/C(52,4) * C(10,2) =~ 4.5%.

[PairTheBoard]

Is that an exact solution Bruce? If so it must be the slickest I've ever seen. Could you explain it please? I'm afraid I'm not seeing it.

PairTheBoard

[BruceZ]

[ QUOTE ]
Is that an exact solution Bruce? If so it must be the slickest I've ever seen. Could you explain it please? I'm afraid I'm not seeing it.

[/ QUOTE ]

Yes it's exact. The explanation was here. It's a simple application of the inclusion-exclusion principle. We start by adding the probabilities even though the events are not mutually exclusive. This is the first term 10*6/C(52,2). This has the effect of double counting the deals where 2 players have AA, so we subtract that off in the second term to get the exact answer. I used a little trick for this second probability by noting that 2 players must have all 4 aces, and there is just 1 combination of 4 cards out of C(52,4) that is 4 aces. Then since only 1 pair of players can have AA, the pairs of players are mutually exclusive, so multiply 1/C(52,4) by the number of pairs C(10,2) to get the probability of 2 players having AA, and we're done. So the final exact answer is 10*6/C(52,2) - C(10,2)/C(52,4).

Let me know if you see it OK now. I have quite a few similar examples all over this forum and in the archives. Search for inclusion-exclusion.

[PairTheBoard]

Wow. That is nice. I would have never thought of that
C(10,2)/C(54,4)
and I don't think I've ever seen it before. Identify the two players that are to get the AA,AA. Then the probability that they get dealt AA,AA is the same as the probabilty that when 4 cards are dealt they are all Aces. 1/C(52,4). Then C(10,2) ways of idendifying the two players. As you say, they are mutually exculsive.Amazing.

That's what I hate about these kinds of problems. If you see the trick they can be easy. If you don't they can get a lot more complicated.

Thanks,

PairTheBoard

[King Yao]

I am not confident I am right, that is why I ask...but here's my logic.

1 - [(48/52) + (4/52 x 48/51)]^10 = 4.4%

(48/52) = probability that the first card for the first player is not an Ace
(4/52 x 48/51) = probability that if the first card is an Ace, that the second card is not an ace

[(48/52) + (4/52 x 48/51) = probablity that both cards aren't an ace. This equals 220-1.

then I take it to the 10th power. each player has a 220/221 chance of not have AA. if the cards are independent (ah, now that I am writing this, I realize this is probably where the problem is), then raising them to the 10th power gets the probability that no one has AA.

Subtracting that term from 100% gets the chance that at least one player has AA.

Is the problem with my formula where I noted above in ()?

[PairTheBoard]

Yes, I see it now. In the term (4/52 x 48/51), I thought it said (4/52 + 48/51) which made no sense to me. Did you change it or did I misread it originally?

And as Bruce says this is a lower aproximation because the term (4/52 x 48/51)^10 should be:

P(1st player no AA) * P(2nd player no AA Given 1st player no AA) * ... * P(10th player No AA Given 1st 9 players No AA).

Conditioned on the previous players not having AA the deck should becoming slightly more rich in Aces, making succeeding probabilities of not have AA less and the product less. Thus making 1-Product slightly Greater than your answer.

PairTheBoard

[scottjack]

The probability of any single person getting pocket aces is 6/1326 (6 different pairs of aces, divided by 1326 possible 2 card hands) Given that, the probability that a single person is NOT dealt pocket aces is 1320/1326

1-(1320/1326)^10= .044338542

Looks like we agree, pretty darn close anyway

[bigbull266]

Using combinations there are 1326 different 2 card combinations in a 52 card deck. 6 of those combinations can be pocket aces or about .4%. I just read an excellent book on how to calculate all these kinds of scenarios by Mike Petriv. The book is called Hold'em's odd(s) book.