Poker-AI.org

Poker AI and Botting Discussion Forum
It is currently Mon Oct 14, 2019 8:47 am

All times are UTC




Post new topic Reply to topic  [ 8 posts ] 
Author Message
 Post subject: HU LUT 1 vs 1
PostPosted: Sat Sep 14, 2019 4:02 pm 
Offline
Senior Member
User avatar

Joined: Sun Mar 10, 2013 10:31 am
Posts: 111
Have anybody HU LUT 1 vs 1?
1326 x 1326 x data_size?
Calculating now own, but speed too slow.
65k itterations for each, 4 cores, and it will take about 22 hours.
My data size is 2 bytes.
Probability of player1 win in 1/0xFFFF parts. (+1/2 of draw)
Think that 0xFFFF itterations is not enought to this. Need mutch more (10x?)


Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Sat Sep 14, 2019 4:35 pm 
Offline
Site Admin
User avatar

Joined: Sun Feb 24, 2013 9:39 pm
Posts: 594
I lost them but they were too big to send easily anyway.

If I remember correctly on ancient machine single threaded exploiting isomorphisms and calculating exactly
16432 turn matrices at 2 seconds each => 9 hours
1755 flop matrices at 20 seconds each => 10 hours
preflop can't remember
river matrices not required just hand ranks for each board

I calculated in java floats (4 bytes) but I doubt you need more than 1 byte accuracy (1 in 256)


Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Sat Sep 14, 2019 4:44 pm 
Offline
Senior Member
User avatar

Joined: Sun Mar 10, 2013 10:31 am
Posts: 111
I use 2 bytes per hand (1/65k probability resolution)
too big size? 1326*1326*2bytes = 3.5Mbytes


Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Sat Sep 14, 2019 5:19 pm 
Offline
Site Admin
User avatar

Joined: Sun Feb 24, 2013 9:39 pm
Posts: 594
Should be plenty. But you only need half the matrix.


Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Sat Sep 14, 2019 5:52 pm 
Offline
Senior Member
User avatar

Joined: Sun Mar 10, 2013 10:31 am
Posts: 111
spears wrote:
But you only need half the matrix.

Yes, but dont want to write complicated code to deal with half (less than half) matrix.
Only 2x size reduction. Think in 2019 3.5Mb or 1.5Mb doesnot mater :)

Will put here code after doing some code revision. May be someone want to calculate this lut in more precision.
Think to get precizion as last bit in 2 bytes (1/65000) need about 100 * 65k itterations.
Will also put 65k itterations lut later.


Attachments:
File comment: HU 1 vs 1 LUT
code.zip [14.63 KiB]
Downloaded 34 times
Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Sat Sep 14, 2019 9:27 pm 
Offline
Senior Member

Joined: Wed Mar 20, 2013 1:43 am
Posts: 248
You mean preflop equities?


Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Sun Sep 15, 2019 4:32 am 
Offline
Senior Member
User avatar

Joined: Sun Mar 10, 2013 10:31 am
Posts: 111
HontoNiBaka wrote:
You mean preflop equities?

yes. want to repeat HU nash table :)


Top
 Profile  
 
 Post subject: Re: HU LUT 1 vs 1
PostPosted: Mon Sep 16, 2019 7:44 am 
Offline
Senior Member
User avatar

Joined: Sun Mar 10, 2013 10:31 am
Posts: 111
About precision of calculating win equity. Founded that there are ABSOLUTE precision!
Hero has 2 cards, opp has 2 cards too.
In deck are 48 cards remaining. So it can only be 1 712 304 possible turns.
3 possible results: wi1, win2, draw.
As pokers rule said if draw -> bank splitted.
So for win player got 2 points, for draw 1 point, for loose 0 points.
So maximum point hero can win (100%) = 1712304*2 = 3424608.
And any win probability can be reprezented as N/3424608, whee N is INTEGER.
So there is absolute ultimate precision. :) (and only 4 bytes need to store)
Will have it in about a week of calculations :)


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

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:
cron
Powered by phpBB® Forum Software © phpBB Group