hand evaluator that in pseudo-code does this: How do then billion record databases get anything accomplished?My whole dictionary when saved to a file takes 88 Mb - is that a HUGE database?Īnd finally I made a full hand vs. rows x 2 columns and the search is SO PROHIBITIVELY slow. 23-24 seconds.This is a a part that I do not understand!!!I have basically a database that has 2.6 mil. 10 000 000 (10 million) board searches takes approx. Once all 5-card combinations are evaluated I will save them in a dictionary and next time I will load the dictionary and when I have any 5-card combination I will simply look up the result.Īnother disappointment. I kind of expected that thinking my 5-card evaluator can't be the champion of algorithm competitions and surely there is a better way to do it (I can post it here if it is of relevance), but I thought never mind. Now I tried to evaluate every possible 5-card combination out of those 2.6 millions and it took disappointing 51 seconds. over all 2 598 960 card ccombinations and the frequencies check out ( ) I checked with theoretical number of royal flushes, quads, full houses etc. So it differentiates between A 9 8 7 3 and A 9 8 7 5 flush or high-hand. In order to to that I needed to code an evaluator for any 5 card combination.I did that and it does the job perfectly, considers every card in a hand and produces a tuple as an output, for example: ('2h', '3c', '4s', '6s', 'Jh'): (0, 11, 6, 4, 3, 2) My goal was to code the equivalent of Equilab or for me. The computer that I use is a desktop i7-4790 3.6 Ghz with 16 GB of RAM along with Jupyter Notebooks.

I have no formal training in neither of those and I am not aware of what is in the curriculum of a computer science class. First a disclaimer: I am a medical professional who plays with both Python and poker as a hobby.

Poker hand equity calculator free