6781097126

6781097126



EPIA'2011


ISBN: 978-989-95618-4-7

In order to use Weka. the extracted gamę States must be converted to an ARFF file, which is the file fonnat that can be inlerpreted by Weka algorithms. The structure of the extracted ARFF files can be found on the table below (Table 2).

Tablc 2. Actions training set characteristics.

Name_Type_Description

win prób

Numeric (0-100%}

The probability of winning the gamę

position

Nominał {Early. Late}

The position of the player on the table. which defines the order of playing.

possible_eamings

Numeric {0-100%}

Minimum amount of money that the player can win by placing this bet. The amount is relative to the current player chips.

action

Nominał {Cali. Raise}

The action that was took by the player.

betted_money

Numeric {0-100%}

The exact ąuantity of chips that was wagered by the player. The ąuantity is relative to the current player chips. If the player goes all-in, the value of betted money is 1.


As it can be obsened. the training featnres are either numeric or nominał. To be noted that all numerical values were nonnalized (all of them belong to an inten al between 0 and 1). Tliis way it is possible to maintain consistency and comparability between dilferent data instances. One cxample of generated ARFF file can be found below. Another important notę was the removal of minimum bet and number of opponents attributes. The number of opponents was removed because it was redundant sińce the winning probability formula already considers tlie number of opponents (the morę opponents we have, the less is the probability of winning with the same hand). The minimum bet was removed because it was considercd redundant by Weka. by applying the RemoveUseless filter. This filter remores attributes that do not vary much.

0relation poker_plays 0attribute win_prob numeric 0attribute position {Early, Late}

0attribute possible_earnings numeric 0attribute action (Cali, Raise)

0attribute min_bet numeric 0attribute betted_money numeric 0data

0.358,Late ,0.000,Raise,0.000,0.008 0.434,Late ,0.023,Raise,0.008,0.024 0.412,Early,0.004,Raise,0.004,0.009 0.370,Early,0.027,Cali ,0.009,0.009 0.762,Late ,0.000,Raise,0.000,0.007

The action types were simplified. There are in total 5 possible types of non-forfeit actions in No Limit Texas Hołd em: Bet, Raise. All-ln, Cali and Check. Bet is in reality a Raise before anyone betting. All-ln is a special Raise where the player puts all his money on the pot. Check is a special Cali without putting any money on the table. For this reason. the action attribute was simplified to only have two possible values: Cali or Raise. Fold actions are not considered in this problem, because we had

78



Wyszukiwarka

Podobne podstrony:
EPIA 2011 ISBN: 978-989-95618-4-7Identifying Player’s Strategies in No Limit Texas Hold’em Poker thr
EPIA 2011 ISBN: 978-989-95618-4-7 no information about the cards of the player when they folded the
EPIA 2011 ISBN: 978-989-95618-4-7 Since the freąuencies are relatwe. the sum of the freąuencies of
EPIA 2011 ISBN: 978-989-95618-4-7 agents to become better players. Tliis is because when the agent i
EPIA 2011 ISBN: 978-989-95618-4-7 Thus. the purpose of tliis study is to identify groups of similar
EPIA 2011 ISBN: 978-989-95618-4-7 If the player folds 72% or inore hands then he is considered to be
EPIA 2011 ISBN: 978-989-95618-4-7 once and then evaluates them. Some well-known partitioning methods
EPIA 2011 ISBN: 978-989-95618-4-7 By measuring the freąuency of each gamę move by the extracted play
EPIA 2011 ISBN: 978-989-95618-4-7 *** SUMMARY *** Total Pot($12) Seat 4: PtgusfQqsttogld64pQOGw (big
EPIA 2011 ISBN: 978-989-95618-4-7 To extract the gamę State of a database of played poker, an applic
ISBN: 978-989-95618-4-7 For post-flop rounds. the Expectation Maximization algorithm resulted in fiv
EPIA 2011GC ®_© O © Fig. 1. Poker table initial configuration ©© ISBN: 978-989-95618-4-7 After
ISBN: 978-989-95618-4-7 Regarding possible eamings. it is possible to obsener that the stakes are mu
J. Piszcwski, Ekonomika integracji europejskiej, Kraków 2011 ISBN: 978-83-7587-698-7, © by Oficyna W
J. Piszewski, Ekonomika integracji europejskiej, Kraków 2011 ISBN: 978-83-7587-698-7, ©by Oficyna Wy
J. Piszewski, Ekonomika integracji europejskiej, Kraków 2011 ISBN: 978-83-7587-698-7, © by Oficyna W
J. Piszewski, Ekonomika integracji europejskiej, Kraków 2011 ISBN: 978-83-7587-698-7, ©by Oficyna Wy
J. Piszewski, Ekonomika integracji europejskiej. Kraków 2011 ISBN: 978-83-7587-698-7, ©by Oficyna Wy
J. Piszewski, Ekonomika integracji europejskiej, Kraków 2011 ISBN: 978-83-7587-698-7, © by Oficyna W

więcej podobnych podstron