Poker-AI.org

Poker AI and Botting Discussion Forum
It is currently Mon Nov 13, 2023 2:10 pm

All times are UTC




Post new topic Reply to topic  [ 3 posts ] 
Author Message
PostPosted: Thu May 08, 2014 5:07 pm 
Offline
Junior Member
User avatar

Joined: Sun Mar 17, 2013 10:03 pm
Posts: 25
It's a typical problem in no-limit TH: abstracting all possible bet/raise sizes into just a few to make the game smaller.
Why I'm looking into this: I'm using MCTS, an algorithm that builds a search tree, trying to estimate the actual game tree using simulation and resulting in an estimation of the EV for each possible action.

So with the goal of getting the best estimation of EV in mind, this is what I'm thinking for decision nodes (try to stay with me ;)):
The chosen branches should lead to the highest divergency in poker situations. Eg. as a player, you will probably have the same reaction to a minimum raise, and a minimum + $0.01 raise. So I think a good abstraction would be taking together those gamestates where the opponent will react the same, or similar, think the same about my cards.

These ranges of bet sizes are of course different for every player, so we should look to make an estimation of the average player. I think a good estimation would be based on the pot odds (or implied odds), but how exactly that would go, I've yet to figure out.

Once we decided on these ranges, I think the bet/raise size should be equal to a weighted average, with the weights equal to the chance of the betsize (for example given by a learned distribution, player-specific or general).

So now you know what I'm thinking, I have some questions:
1. What do you think about this thought process?

2. Do you think the same could be said about opponent nodes?

3. I'm also thinking about if a different abstraction should be made in the root node and in another decision node. I think not, but I'm not sure. Also, can I reduce the number of branches if we go deeper into the tree?

4. And a last thought I had: is all the trouble of finding a good abstraction worth the while, comparing it to an uniform abstraction (X branches, spread uniformly over the ) or an expert knowlegde abstraction (eg. {0,5; 0,8; 1; 2} * potsize)?


PS. Some relevant approaches I've found:
- viewtopic.php?f=25&t=6.
- sampling from a learned distribution


Top
 Profile  
 
PostPosted: Sun May 11, 2014 3:39 pm 
Offline
Site Admin
User avatar

Joined: Sun Feb 24, 2013 9:39 pm
Posts: 642
I have an idea you might like to try...

Find out by experiment if ev is a continuous function of bet size with a single maximum. If it is you can use simple optimisation to determine the bet size with highest ev. With a bit of luck, the bet size for max ev in one situation will be similar to the bet size for for max ev in a "nearby" situation.


Top
 Profile  
 
PostPosted: Sat May 24, 2014 12:57 pm 
Offline
Veteran Member

Joined: Thu Feb 28, 2013 2:39 am
Posts: 437
Could you solve an EQ then prune the dominated actions?


Top
 Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 3 posts ] 

All times are UTC


Who is online

Users browsing this forum: No registered users and 2 guests


You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

Search for:
Powered by phpBB® Forum Software © phpBB Group