Poker-AI.org

I've written a solver that solves turn and river subgames with limited bet size options like commercial solvers (e.g. piosolver, Simple Postflop, GTO+). I went with an implementation of discounted cfr, which is very similar to cfr+. My code is multi-threaded and written in Java. It could easily be modified to solve flop subgames. Currently I'm working on a c++ implementation to get more speed (my solver is 50% slower than piosolver, at least in the few tests I've ran).

Here's the repository: https://github.com/Fossana/discounted-cfr-poker-solver

Hope this helps!

Good man.

Excelent work,dude

Great work. I am working on a similar project, really the CFR algorithms are something I just implement from papers and hope to forget soon. But if you need help with C++ I would be happy to help, it can be quite weird coming from Java.

I actually got my c++ implementation done. I did a lot of optimizing and it’s 30-50% faster than piosolver on turn subgames and 10% slower than piosolver for for flop subgames (not sure why flop subgames are so much slower). My trees take 2-4x as much memory as piosolver though, depending on the number of bet sizes, so i’m working on compression.

He's fuk**n Genius, )) Dude it's amazing!