| Poker-AI.org http://poker-ai.org/phpbb/ |
|
| Pure CFR speed http://poker-ai.org/phpbb/viewtopic.php?f=26&t=2817 |
Page 1 of 1 |
| Author: | HontoNiBaka [ Tue Oct 07, 2014 2:08 am ] |
| Post subject: | Pure CFR speed |
Recently I've read Amax' post in the old forum, where he said, that his CS-CFRM algorithm runs at 550k iterations per second. I have been using the pure cfr open source code and even when I completelly diasble bucketing and hand evaluation, which means I just always return 0 (for testing purposes, of course this gives wrong results) I only manage to get about 30k iterations per seconds, even with multithreading. So even just the recursion through the tree takes way longer. Is the algorithm just inefficient? What can I do to speed it up? |
|
| Author: | algonoob [ Fri Oct 10, 2014 1:31 am ] |
| Post subject: | Re: Pure CFR speed |
is this for nl or fl? if nl, what betting abstraction & stack size? |
|
| Author: | HontoNiBaka [ Tue Oct 14, 2014 4:09 am ] |
| Post subject: | Re: Pure CFR speed |
This was for FL. |
|
| Author: | algonoob [ Tue Oct 14, 2014 11:25 pm ] |
| Post subject: | Re: Pure CFR speed |
you might be encountering false sharing by making every thread edit that single location in memory. if you get rid of the writes you might see a drastic performance increase. or you can actually use bucketing. |
|
| Page 1 of 1 | All times are UTC |
| Powered by phpBB® Forum Software © phpBB Group http://www.phpbb.com/ |
|