Two Plus Two Newer Archives  

Go Back   Two Plus Two Newer Archives > General Gambling > Probability
FAQ Community Calendar Today's Posts Search

Reply
 
Thread Tools Display Modes
  #1  
Old 04-01-2007, 11:26 AM
mwette mwette is offline
Member
 
Join Date: Mar 2007
Posts: 71
Default prob of beating N opponents given prob of beating 1 opponent

I want to make sure that I have this right for texas hold'em.
If I know my pocket cards and any common cards then I
should be able to compute the odds of beating one opponent.
[In fact I have written code to use poker-eval library to
do this.] If the probability that I beat one opponent is p,
then is the probability that I bean N opponents roughly N*p?
Reply With Quote
  #2  
Old 04-01-2007, 11:31 AM
neverforgetlol neverforgetlol is offline
Senior Member
 
Join Date: Oct 2005
Posts: 6,048
Default Re: prob of beating N opponents given prob of beating 1 opponent

I think you mean p^N, p*N can be greater than 1, so that can't be a probability.
Reply With Quote
  #3  
Old 04-01-2007, 11:35 AM
smbruin22 smbruin22 is offline
Senior Member
 
Join Date: Aug 2005
Posts: 2,524
Default Re: prob of beating N opponents given prob of beating 1 opponent

respondant is correct.... of course, your odds of beating the second guy won't be same as beating the first, might be ok for an assumption though in certain circumstances.....

nice thing is that if you have TT, and one opponent has AK and another AQ, then their sharing of the aces cuts down on their cumulative winning percentage. if they have QJ and AK against your TT, then that's a big problem.
Reply With Quote
  #4  
Old 04-01-2007, 12:21 PM
mwette mwette is offline
Member
 
Join Date: Mar 2007
Posts: 71
Default Re: prob of beating N opponents given prob of beating 1 opponent

Right. I meant p^N. But I think it's only an approximation.
I would like to understand if this is indeed an approximation
and if so, how good is it.
Reply With Quote
  #5  
Old 04-01-2007, 12:56 PM
pzhon pzhon is offline
Senior Member
 
Join Date: Mar 2004
Posts: 4,515
Default Re: prob of beating N opponents given prob of beating 1 opponent

[ QUOTE ]
Right. I meant p^N. But I think it's only an approximation.
I would like to understand if this is indeed an approximation
and if so, how good is it.

[/ QUOTE ]
In general, it's a terrible approximation.

Multiplying probabilities is correct for independent results. The probability that the next 10 coinflips are all heads is the product of the probabilities of a head on each toss.

In a competition, how you compare against one opponent is not independent of how you compare against another opponent. This is particularly true for drawing hands. A strong draw which hits is likely to beat all opponents. If you have the nut flush draw on the flop, most of your wins against made hands come from making your flush. To beat 9 opponents, you don't need to hit 9 flushes in a row, just one.

You can't determine how well a hand will do against n random opponents from how well the hand does against 1. You have to know how the hand wins. 22 is about 50% against 1 random opponent since 22 unimproved often wins. Against 3 random opponents, 22 unimproved is highly unlikely to win, and the probability of hitting a set is too low (but greater than 0.5^3). 22 wins 21.5%. 98s also wins about 50% against a random hand, but a larger fraction of its wins come from making big hands like straights and flushes which are very likely to win against 3 opponents. 98s wins 28.1% against 3 random opponents.
Reply With Quote
  #6  
Old 04-01-2007, 03:25 PM
neverforgetlol neverforgetlol is offline
Senior Member
 
Join Date: Oct 2005
Posts: 6,048
Default Re: prob of beating N opponents given prob of beating 1 opponent

yeah it's bad for the reasons you stated, just figured that was his typo.
Reply With Quote
Reply


Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -4. The time now is 10:16 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.