Effective hand strength algorithm

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Effective Hand Strength (EHS) is a poker algorithm conceived by computer scientists Darse Billings, Denis Papp, Jonathan Schaeffer and Duane Szafron that was published for the first time in the It has since then been considered as a reference in the realm of poker artificial intelligence and has been the basis of further research such as: * * *

Effective Hand Strength (EHS) is a poker algorithm conceived by computer scientists Darse Billings, Denis Papp, Jonathan Schaeffer and Duane Szafron that was published for the first time in the It has since then been considered as a reference in the realm of poker artificial intelligence and has been the basis of further research such as: EHS = HS \times (1 - NPOT) + (1-HS) \times PPOT where: EHS is the Effective Hand Strength HS is the current Hand Strength (i.e. not taking into account potential to improve or deteriorate, depending on upcoming table cards NPOT is the Negative POTential (i.e. the probability that our current hand, if the strongest, deteriorates and becomes a losing hand) PPOT is the Positive POTential (i.e. the probability that our current hand, if losing, improves and becomes the winning hand)

Pseudocode

Hand Strength (HS) will enumerate all possible opponent hand cards and count the occurrences where our hand is strongest (+50% of the cases where we are tied): HandStrength(ourcards, boardcards) { ahead = tied = behind = 0 ourrank = Rank(ourcards, boardcards) for each case(oppcards) { opprank = Rank(oppcards, boardcards) if (ourrank > opprank) ahead += 1 else if (ourrank == opprank) tied += 1 else behind += 1 } handstrength = (ahead + tied / 2) / (ahead + tied + behind) return handstrength } In addition, EHS will consider the hand potential (i.e. its probabilities to improve or deteriorate): HandPotential(ourcards, boardcards) { // Hand potential array, each index represents ahead, tied, and behind integer array HP[3][3] // initialize to 0 integer array HPTotal[3] // initialize to 0 ourrank = Rank(ourcards, boardcards) // Consider all two card combinations of the remaining cards for the opponent for each case(oppcards) { opprank = Rank(oppcards, boardcards) if (ourrank > opprank) index = ahead else if (ourrank == opprank) index = tied else index = behind HPTotal[index] += 1 // All possible board cards to come for each case(turn, river) { // Final 5-card board board = [boardcards, turn, river] ourbest = Rank(ourcards, board) oppbest = Rank(oppcards, board) if (ourbest > oppbest) HP[index][ahead] += 1 else if (ourbest == oppbest) HP[index][tied] += 1 else HP[index][behind] += 1 } } // Ppot: were behind but moved ahead Ppot = (HP[behind][ahead] + HP[behind][tied] / 2 + HP[tied][ahead] / 2) / (HPTotal[behind] + HPTotal[tied]) // Npot: were ahead but fell behind Npot = (HP[ahead][behind] + HP[tied][behind] / 2 + HP[ahead][tied] / 2) / (HPTotal[ahead] + HPTotal[tied]) return [ Ppot, Npot ] }

Text derived from https://en.wikipedia.org/w/index.php?oldid=1376811855 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001376811855 · captured 1790411026.0 · version history

Cite this page as: encyclopegia.org, “Effective hand strength algorithm”, snapshot enwiki-001376811855. https://encyclopegia.org/a/effective-hand-strength-algorithm

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.