Skip to content

An efficient poker hand evaluation algorithm and its implementation

License

Notifications You must be signed in to change notification settings

ohwi/PokerHandEvaluator

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PH Evaluator

Build Status

A Poker Hand Evaluator based on a Pefect Hash Algorithm

Overview

Efficiently evaluating a poker hand has been an interesting but challenging problem. Given two different poker hands, how to determine which one is stronger? Or more generally, given one poker hand, can we assign a score to it indicating its strength?

Cactus Kev once gave an answer for a five card poker hand evaluation. With smart encoding, it ranks each hand to 7462 distinct values.

Still, Kev's solution is specific for a five-card hand. To evaluate a seven-card poker hand (which is more popular because of Texas Hold'em) using Kev's algorithm, one brute force solution is to iterate all 7 choose 5 combination, running his five-card evaluation algorithm 21 times to find the best answer, which is apparently too time-inefficient.

PH Evaluator is designed for evaluating poker hands with more than 5 cards. Instead of traversing all the combinations, it uses a perfect hash algorithm to get the hand strength from a pre-computed hash table, which only costs very few CPU cycles and considerably small memory (~100kb for the 7 card evaluation).

Algorithm

This documentation has the description of the underlying algorithm.

C/C++ Implementation

The cpp subdirectory has the C/C++ implementation of the algorithm, offering evaluation from 5-card hands to 9-card hands.

The latest benchmark report generated by Google Benchmark:

2019-10-08 23:56:37
Running ./benchmark_phevaluator
Run on (2 X 2300 MHz CPU s)
CPU Caches:
  L1 Data 32K (x1)
  L1 Instruction 32K (x1)
  L2 Unified 256K (x1)
  L3 Unified 46080K (x1)
Load Average: 1.00, 1.01, 0.85
***WARNING*** Library was built as DEBUG. Timings may be affected.
--------------------------------------------------------------------
Benchmark                          Time             CPU   Iterations
--------------------------------------------------------------------
EvaluateAllFiveCardHands    64214505 ns     64213633 ns           11
EvaluateAllSixCardHands    544651414 ns    544637242 ns            1
EvaluateAllSevenCardHands 3760178653 ns   3760137811 ns            1
EvaluateAllEightCardHands 23088093903 ns   23087979165 ns            1
EvaluateAllNineCardHands  132522346551 ns   132511341434 ns            1
Number of Hands Time Used Hands per Second Memory Used
5-card Hands 2598960 64213633 ns 40 M/s 328K
6-card Hands 20358520 544637242 ns 37 M/s 328K
7-card Hands 133784560 3760137811 ns 35 M/s 328K
8-card Hands 752538150 23087979165 ns 32 M/s 328K
9-card Hands 3679075400 132511341434 ns 27 M/s 328K
  • Because the evaluators from 5-card to 9-card are sharing to the same library, so the memory used measure currently is the maximum of the 5 evaluators. This will be fixed in the future.

Other Implementations

There is a javascript implementation using the same algorithm.

About

An efficient poker hand evaluation algorithm and its implementation

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C 65.0%
  • Python 24.5%
  • Objective-C 10.1%
  • C++ 0.3%
  • CMake 0.1%
  • Makefile 0.0%