C# 클래스 HoldemHand.Hand

Count Bits. Optimized for cards so only works with 52 bits.

Given a card value, returns it's rank

Given a card value, returns it's suit

This method allows a foreach statement to iterate through each card in a card mask.

Used to compare one mask to another. This method allows normal compare functions to work as expected with a mask.

Returns the count of adjacent cards

Returns the count of adjacent cards

Takes an string describing a mask and returns the description.

Evaluates a hand and returns a descriptive string.

Cacluates the approxamate odds that each player and opponent mask type has to win. This method uses Monte Carlo Analysis to determine a results. The quality of the result will depend on the amount of time allowed for the simulation.

Cacluates the approxamate odds that each player and opponent mask type has to win. This method uses Monte Carlo Analysis to determine a results. The quality of the result will depend on the number of trials.

Cacluates the approxamate odds that each player and opponent mask type has to win. This method uses Monte Carlo Analysis to determine a results. The quality of the result will depend on the amount of time allowed for the simulation.

Cacluates the approxamate odds that each player and opponent mask type has to win. This method uses Monte Carlo Analysis to determine a results. The quality of the result will depend on the number of trials.

The method returns the number of draws that are possible for the specified HandType.

The method returns the number of draws that are possible for the specified HandType. Note that DrawCount(pocket, board, dead, type) is not necessarily the same as DrawCount(pocket | board, dead, type). This method returns all possible draws that are the same as the requested type.

The method returns the number of draws that are possible for the specified HandType. This method only returns the counts that improve the player's mask rather than just the board. Because of this subtle distinction, DrawCount(player, board, dead, type) doesn't necessarily return the same value as DrawCount(player | board, dead, type).

Test for equality

Evaluates a mask (passed as a string) and returns a mask value. A mask value can be compared against another mask value to determine which has the higher value.

Evaluates a mask (passed as a mask mask) and returns a mask value. A mask value can be compared against another mask value to determine which has the higher value.

Evaluates a mask (passed as a mask mask) and returns a mask value. A mask value can be compared against another mask value to determine which has the higher value.

Evaluates the card mask and returns the type of mask it is. This function is faster (but provides less information) than Evaluate or Evaluate.

This function is faster (but provides less information) than Evaluate or Evaluate.

Counts the number of hands that are a flush with one more drawn card.

Counts the number of hands that are a flush with one more drawn card. However, Flush hands that only improve the board are not considered.

Counts the number of empty space between adjacent cards. 0 means connected, 1 means a gap of one, 2 means a gap of two and 3 means a gap of three. This method calculates the results. Because of that equivelent call in PocketHands is preferred because it uses a lookup table and is faster. This function remains to allow for automated testing.

Returns hash code

Default constructor

Constructor

This method returns the mask distance from the best possible mask given this board (no draws are considered). The value 0 is the best possible mask. The value 1 is the next best mask and so on.

This method is similar to the HandPotential algorithm described in Aaron Davidson's masters thesis, however if differs in several significant ways. First, it makes the calculation while accounting for one or more opponents. Second, it uses the Monte Carlo technique to get answers in a reasonable amount of time (a duration of 0.1 seems to give reasonable results). And finally, the results are not normalized; the positive and negative potential is the actual odds of improvement or worsening of a mask.

Returns the normalized, positive and negative potential of the current mask. This funciton is described in Aaron Davidson's masters thesis on page 23.

This method is similar to the HandPotential algorithm described in Aaron Davidson's masters thesis, however if differs in several significant ways. First, it makes the calculation while accounting for one or more opponents. Second, it uses the Monte Carlo technique to get answers in a reasonable amount of time (a duration of 0.1 seems to give reasonable results). And finally, the results are not normalized; the positive and negative potential is the actual odds of improvement or worsening of a mask.

A HandStrength function that accounts for multiple opponents. This method uses the Monte Carlo menthod to calculate a value. It takes surprisingly little time to get good results. A duration of 0.01 seconds (10mS) returns good results, and a duration of 0.1 (100mS) returns even better results.

The classic HandStrengh Calculation from page 21 of Aaron Davidson's Masters Thesis.

Given a set of pocket cards and a set of board cards this function returns the odds of winning or tying for a player and a random opponent.

This method calculates the probablity of a player winning with specific hands and opponents winning with specific hands.

Used to calculate the wining information about each players mask. This function enumerates all possible remaining hands and tallies win, tie and losses for each player. This function typically takes well less than a second regardless of the number of players.

Given a set of pocket cards and a set of board cards this function returns the odds of winning or tying for a player and a random opponent.

This method calculates the probablity of a player winning with specific hands and opponents winning with specific hands.

Enables a foreach command to enumerate all possible ncard hands.

Enables a foreach command to enumerate all possible ncard hands.

Returns true if there are three cards of the same suit. The pocket cards must have at least one card in that suit.

Returns true if there are three cards of the same suit. The pocket cards must have at least one card in that suit.

Returns true if the cards in the two card mask are connected. This method calculates the results. Because of that equivelent call in PocketHands is preferred because it uses a lookup table and is faster. This function remains to allow for automated testing.

Returns true if there are 4 cards of the same suit.

Returns true if the hand is a flush draw.

Returns true if there are 4 cards of the same suit.

Return true if the combined cards contain a gut shot straight.

Return true if the combined cards contain a gut shot straight.

Return true if the combined cards contain a gut shot straight.

Return true if the combined cards contain a gut shot straight.

Returns true if the mask is an open ended straight draw.

Returns true if the combined mask is an open ended straight draw.

Returns true if the combined mask is an open ended straight draw.

Returns true if the combined mask is an open ended straight draw. Only straight possiblities that improve the player's mask are considered in this method.

Returns true if the passed mask only needs one card to make a straight. Note that the pocket cards must contains at least one card in the combined straight.

Returns true if the passed mask only needs one card to make a straight.

Returns true if the passed mask only needs one card to make a straight. Note that the pocket cards must contains at least one card in the combined straight.

Returns true if the passed mask only needs one card to make a straight. Note that the pocket cards must contains at least one card in the combined straight.

This function returns true if the cards in the mask are all one suit. This method calculates the results. Because of the equivelent call in PocketHands is preferred because it uses a lookup table and is faster. This function remains to allow for automated testing.

This is a fast way to look up the index mask.

Turns a card mask into the equivalent human readable string.

Returns a string of the possible outs for the next card. Note that cards that only help the board will be ignored.

Returns the number of outs possible with the next card. Note that cards that only help the board will be ignored.

Returns the number of outs possible with the next card.

Returns the number of discouted outs possible with the next card. Players pocket cards The board (must contain either 3 or 4 cards) A list of zero or more opponent cards. The count of the number of single cards that improve the current hand applying the following discouting rules: 1) Drawing to a pair must use an over card (ie a card higher than all those on the board) 2) Drawing to 2 pair / pairing your hand is discounted if the board is paired (ie your 2 pair drawing deat to trips) 3) Drawing to a hand lower than a flush must not make a 3 suited board or the board be 3 suited. 4) Drawing to a hand lower than a stright, the flop must not be 3card connected or on the turn allow a straight to be made with only 1 pocket card or the out make a straight using only 1 card. Function provided by Matt Baker.

Creates a Hand mask with the cards that will improve the specified players mask against a list of opponents or if no opponents are list just the cards that improve the players current had. Please note that this only looks at single cards that improve the mask and will not specifically look at runner-runner possiblities.

Creates a Hand mask with the cards that will improve the specified players hand against a list of opponents or if no opponents are list just the cards that improve the players current hand. This implements the concept of 'discounted outs'. That is outs that will improve the players hand, but not potentially improve an opponents hand to an even better one. For example drawing to a straight that could end up loosing to a flush. Please note that this only looks at single cards that improve the hand and will not specifically look at runner-runner possiblities. Players pocket cards The board (must contain either 3 or 4 cards) A list of zero or more opponent pocket cards A mask of all of the cards that improve the hand applying the following discouting rules: 1) Drawing to a pair must use an over card (ie a card higher than all those on the board) 2) Drawing to 2 pair / pairing your hand is discounted if the board is paired (ie your 2 pair drawing deat to trips) 3) Drawing to a hand lower than a flush must not make a 3 suited board or the board be 3 suited. 4) Drawing to a hand lower than a stright, the flop must not be 3card connected or on the turn allow a straight to be made with only 1 pocket card or the out make a straight using only 1 card. Function provided by Matt Baker.

Creates a Hand mask with the cards that will improve the specified players mask. Please note that this only looks at single cards that improve the mask and will not specifically look at runner-runner possiblities. This version of outs contributed by Matt Baker

Reads an string definition of a card and returns the Card value.

Parses an string description of a mask and returns a mask mask.

Parse Hand.

This static method parses the passed pocket cards and board and produces a card mask.

Given a pocket pair mask, the PocketHand169Enum cooresponding to this mask will be returned.

This method will return a random mask with the number of cards specified.

This method will randomly chose a pocket mask from the query string that doesn't contain any of the specified dead cards. That pocket mask will be used as a set of shared cards that must be used in the final generated mask. The mask will contain the number of cards specified in the ncards argument.

Returns a randomly generated mask that doesn't include any of the cards in the dead card mask. The mask will return the number of card in the ncards argument.

This method randomly picks from a list of possible masks.

This method randomly picks from a list of possible masks.

Iterates through random hands that meets the specified requirements until the specified time duration has elapse. Please note that this iterator requires interop. If you need and interop free mask evaluator you should remove this function along with the other interop functions in this file.

Iterates through random hands with ncards number of cards. This iterator will return the number of masks specifed in trials. Masks can be repeated.

Interate through the hands defined in the pocket mask definition.

Returns random hands out of the list of mask provided.

This function iterates through random hands returning the number of random hands specified in trials. Please note that a mask can be repeated.

The method returns the number of straight draws that are possible for the current mask.

The method returns the number of straight draws that are possible for the player and board configuration. This method filters the results so only player hand improvements are counted.

Returns the string representing the mask.

This method returns the number of unique mask values that can be made with ncards, where all of the hands contain the shared cards.

This function takes a string representing a full or partial holdem mask and validates that the text represents valid cards and that no card is duplicated.

This function takes a string representing pocket cards and a board and then validates that the text represents a valid mask.

This method returns the approximate odd for the players mask winning against multiple opponents. This uses a default time duration of 0.25S (or 250mS) for the time allotment for Monte Carlo analysis.

This method returns the approximate odd for the players mask winning against multiple opponents.

This method returns the approximate odd for the players mask winning against multiple opponents. This uses a default time duration of 0.25S (or 250mS) for the time allotment for Monte Carlo analysis.

This method returns the exact odds of the specified mask mask winning against an average player. It's reasonably fast because it uses a lookup table when possible.

This method returns the approximate odd for the players mask winning against multiple opponents. This uses a default time duration of 0.1S (or 100mS) for the time allotment for Monte Carlo analysis.

This method returns the approximate odd for the players mask winning against multiple opponents.

Test for inequality.

Parses Card strings (internal)

Updates handmask and handval, called when card strings change