Poker-AI.org

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

View unanswered posts | View active topics


Board index » Public Forums » AI Research

All times are UTC




Post new topic Reply to topic  Page 1 of 1
  [ 5 posts ] 
  Print view Previous topic | Next topic 
Author Message
nemesis17
PostPosted: Fri Dec 06, 2013 12:46 pm 
Offline
Junior Member

Joined: Tue Mar 19, 2013 11:45 pm
Posts: 24
I was trying the amax River Solver (it's the RiverSolver2.zip taken from here http://www.poker-ai.org/archive/www.pok ... a&start=40) with the following board and game tree:



Code:
 

        var board = Hand.ParseHand("2d 6s 8c 7s Ah");

        static Decision CreateGame4(HoleDistribution[] d)
        {
            return
                new Decision
                (
                    0, d,
                    new Decision(1, d,
                        new Showdown(190),
                        new Decision(0, d,
                            new Fold(-190),
                            new Showdown(190 + 230))),
                    new Decision(1, d,
                        new Fold(+190),
                        new Showdown(190 + 230)));


        }
 


However I am getting very odd results. The following is line 3260 taken from the attached solution dump. It shows that player 0 is check/folding the nuts 28% which makes no sense.
Code:
Ts 9s 28 72 | 0.25 0.633300114817056 | -9768030032.41891 150030


Anyone knows what could be wrong here?

Thanks.


Attachments:
solution.zip [30.46 KiB]
Downloaded 481 times
Top
 Profile  
 
nemesis17
PostPosted: Fri Dec 20, 2013 4:19 pm 
Offline
Junior Member

Joined: Tue Mar 19, 2013 11:45 pm
Posts: 24
I figured that there is nothing wrong with the solution except that I didn't interpret the strategy output correctly.
This particular hand is never checked in the first decision node so it never reaches the check-fold leaf obviously.
However I don't understand why the normalized average strategy is not zero in the check-fold and check-call leafs in this example.
Could anyone please explain?

Thanks.
Top
 Profile  
 
proud2bBot
PostPosted: Fri Dec 20, 2013 7:47 pm 
Offline
Senior Member

Joined: Mon Mar 11, 2013 10:24 pm
Posts: 216
In the first iteration, every path of the gametree is reached with every bucket because you have equal probabilities for each possible action...
Top
 Profile  
 
nemesis17
PostPosted: Fri Dec 20, 2013 8:53 pm 
Offline
Junior Member

Joined: Tue Mar 19, 2013 11:45 pm
Posts: 24
proud2bBot wrote:
In the first iteration, every path of the gametree is reached with every bucket because you have equal probabilities for each possible action...


I see and given that the algorithm keeps adding the cumulative strategies the average strategy will never be zero even for unreachable states right?
Top
 Profile  
 
proud2bBot
PostPosted: Sat Dec 21, 2013 2:02 am 
Offline
Senior Member

Joined: Mon Mar 11, 2013 10:24 pm
Posts: 216
correct. you can easily check it: in your case, the cumulative strategy values in this node should be very low (i.e., only visited at the beginning of the learning until the algorithm realized it should never check).
Top
 Profile  
 
Display posts from previous:  Sort by  
Post new topic Reply to topic  Page 1 of 1
  [ 5 posts ] 

Board index » Public Forums » AI Research

All times are UTC


Who is online

Users browsing this forum: No registered users and 1 guest

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