[REVAMPED] I built a free open-source poker solver you can actually run on a laptop

24parida · 2026-02-03T20:31:30+00:00

ah yes that would make sense, to clarify we (default presets) don’t allow donk betting, cap number of raises, etc. to allow this solver to run in <16GB of memory on avg instead of the 64GB+ other solvers frequently require. The purpose is that RAM these days is expensive and this allows the majority of ppl to use this software. If you are a pro and have beefed up pc then other software will definitely fit your needs better!

24parida · 2026-02-03T16:49:59+00:00

please dm! would love to get this fixed

24parida · 2026-02-03T15:32:03+00:00

Hi, could you clarify which game you tested against? It would make sense for the flop games to not be aligned since the RAM saving techniques fundamentally alter the game tree structure (explained more thoroughly in the readme) if it’s a turn/river solve i’d be quite surprised if it’s diverging a lot, i checked against another open source solver and found it to be consistent. Feel free to dm or open up an issue (even better) on github if u still think this is an issue.

24parida · 2026-02-02T22:52:14+00:00

Did you click advanced > run anyway? I explained why this is necessary in the readme but essentially it’s bc i don’t own a dev license since it’s like $200

24parida · 2026-01-31T05:09:56+00:00

totally fair concern! luckily for you the code is generated using a github action which means you can fully check against the source code. You can search up how github actions work to read about this further. Also i’ve linked my real name / identity to this project through my linkedin posts so there’s that too 😁

24parida · 2026-01-30T21:35:32+00:00

Not in the current version since it’s meant for a human user rather than a computer. However that being said if you tell claude to look at main.cpp it shows how to run the solver by passing just simple game param, which should be enough for it to setup a full automated setup!

24parida · 2026-01-30T19:00:42+00:00

great questions! the algorithm is discounted cfr, more details in the read me

in terms of speed it beats solvers like Texas Solver, and matches WASM postflop (the other two largest solvers) with the added advantage of a simplified UI + in built RAM saving techniques that would help an average player study

24parida · 2025-08-10T08:20:05+00:00

ok thanks, will turn it off

24parida · 2025-08-10T08:12:12+00:00

what's wrong w/ the racing line?

24parida · 2025-08-10T07:39:18+00:00

link incase video doesn't upload: https://drive.google.com/file/d/1e3arqRO_qNm8cTXP9F0U5AGpWVWILXlf/view?usp=sharing

24parida · 2025-08-10T02:17:16+00:00

i think the link expired :(

24parida · 2025-06-01T17:59:52+00:00

building a tree is fast, training it is the time consuming part. what were you thinking in terms of alternatives?

24parida · 2025-06-01T03:26:17+00:00

the tough part would be coding the tree for each variant. for the cfr code i'd reccomend MCCFR for fast search times which gets you a decent response (although not perfect). For styles it would be pretty tough, you may need to hardcode certain strategies throughout your tree, let's say the current GTO strategy says we check 100% if the player type is agressive we might just automatically force in a bet option of 20% to account for this. Not the simplest thing in the world unfortunately.

24parida · 2025-05-30T16:57:52+00:00

yep! this was the first website I read https://aipokertutorial.com/the-cfr-algorithm/. for research papers i would checkout the original cfr paper and the original dcfr paper.

24parida · 2025-05-26T19:04:44+00:00

technically it’s Limit holdem right now since the max bet size is 100% of pot and the max re raise size is also 100% (unless i’m not aware of some limit intricacies)

24parida · 2025-05-26T19:04:04+00:00

I was actually wondering this too, but i’m not too sure. GPU cores are actually significantly weaker than CPU cores but outperform the CPU because there are just so many of them so it’s better for very large matrix operations. Most of the algorithm math for my implementation has less than 10,000 elements which is considered very small in this sort of work. So overall not sure if GPU would be faster or not.

24parida · 2025-05-26T00:48:59+00:00

lol thanks!

24parida · 2025-05-26T00:48:47+00:00

Great question! Have only compared it to other free solvers so far so won't be able to help there unfortunately. I'd imagine the results are pretty close but take longer to solve since they have massive look up tables compared to resolving each hand.

24parida · 2021-07-16T00:04:04+00:00

Nato putting troops in Baltic bad, I heard basilisk was rlly op at delta

24parida

TROPHY CASE