Here are some links to articles, which could help as starting points: Poker Logic in C# and Fast, Texas Holdem Hand Evaluation and Analysis “This code snippet will let you calculate poker probabilities the hard way, using C# and .NET.” The theoretical fundamentals are given in this Wikipedia article about Poker Probabilities and in this … Read more
The following may prove useful: The University of Alberta Computer Poker Research Group OpenHoldem Poker Hand Recognition, Comparison, Enumeration, and Evaluation The Theory of Poker The Mathematics of Poker SpecialKPokerEval
Don’t forget that Big-O notations only says how the complexity grows with respect to the size (etc) – it doesn’t give any indication of the constant factors involved. That’s why sometimes even a linear search for keys is faster than a dictionary lookup, when there are sufficiently few keys. In this case you’re not even … Read more
Your overall approach is sound. I’m pretty sure the problem lies with your make_canonical function. You can try printing out the hands with num_cards set to 3 or 4 and look for equivalencies that you’ve missed. I found one, but there may be more: # The inputs are equivalent and should return the same value … Read more
I wrote one in JavaScript. The core evaluating method uses only bit manipulations so is extremely fast. With this in mind, looking at 21 combinations is still very fast. The only time we need to go deeper is when a tie occurs. When this happens, we need to look into more details to see which … Read more
Defeating a bot from the serverside perspective Many online poker sites use popup Captcha inputs that are triggered by suspicious activity. Some poker sites monitor playing times and patterns (i.e., worst case scenario is a player who plays 24×7 and 16 tables continuously, there is a tiny tiny chance this is a real human. (However … Read more