Pot is $ in poker pot minBet is minimum amount you must bet to play
pot odds are calculated by b = Pot/minBet p is the probability of winning a poker hand: 0.0 <= p <= 1.0 q is the probability of loosing a poker hand: q = 1.0 - p f is the calculated kelly bet f = ( b * (p-q)) / b substituting b with Pot/minBet f = ( (Pot/minBet) ( p - q )) / ( Pot/minBet) Solve for max f such that f >= minBet and, f <= Pot I did this with a loop incrementing the value for minBet until it was >= (f + delta) That calculated value of "f" is the max value meeting the constraints. Anybody have a suggestion on how to solve this explicitly and not use a loop? -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
