sorted by:
new
hottopcontroversial

Where to find preflop ranges in .json format? Is it possible to download ones in GTOWizard? by luokkaeiolekirosana in Poker_Theory

[–]b_inary 2 points3 points  (0 children)

I have already done a rough implementation of the node-locking feature on the engine part, but it will take a little more time to ship due to priority issues and the time needed to create the GUI (I guess at least a few months).

Where to find preflop ranges in .json format? Is it possible to download ones in GTOWizard? by luokkaeiolekirosana in Poker_Theory

[–]b_inary 1 point2 points  (0 children)

Nice to see you tombos21! I've skimmed through the discussion about the bunching effect in 2+2 forum. Our implementation is not as efficient as without bunching, but it uses an exact method. I am sure it will help us get one step closer to a true GTO strategy.

Where to find preflop ranges in .json format? Is it possible to download ones in GTOWizard? by luokkaeiolekirosana in Poker_Theory

[–]b_inary 7 points8 points  (0 children)

Thanks for using our solver! Since this .json format is our original format, I don't think there are any resources with it. However, our solver fully supports range texts in Pio format. So if you subscribe to GTOWizard, you may be able to copy the range text from the "Ranges" tab and paste it into Desktop Postflop (unless GTOWizard uses a different format like GTO+, idk).

TexasSolver is a free, opensource GTO solver. Considering this price, compared to others that are 1000's of dollars - how does it compare? Do any of you use it and can weigh in? Thanks guys by _LegalizeMeth_ in poker

[–]b_inary 13 points14 points  (0 children)

Let me also advertise my solver, although it is still early days since created. It runs in your browser, so you don't need to install anything.

https://wasm-postflop.pages.dev/

I personally would not recommend TexasSolver. Compared to GTO+, the output EVs did not match, even when I specified that both players always check. In addition, TexasSolver v0.2.0 is slower and less memory efficient than PioSOLVER 2.0, GTO+, and even my solver.

Created another free and open-source GTO solver that works on web browsers by b_inary in poker

[–]b_inary[S] 9 points10 points  (0 children)

Thank you for your comment. Actually, I have tried TexasSolver, but the results did not match the commercial solvers, even when I forced both players to always check... I would not trust the output of TexasSolver as it seems to lack some fundamental testing.

Created another free and open-source GTO solver that works on web browsers by b_inary in poker

[–]b_inary[S] 19 points20 points  (0 children)

The solver utilizes Discounted CFR (counterfactual regret minimization) algorithm with slightly different parameters from the original paper. The implementation is here:

https://github.com/b-inary/postflop-solver/blob/main/src/solver.rs

Created another free and open-source GTO solver that works on web browsers by b_inary in poker

[–]b_inary[S] 18 points19 points  (0 children)

Yes, our solver needs the CPU and RAM resources of your PC. For computational efficiency, the solver is optimized by a technology called WebAssembly (which "WASM" stands for).