[gmi01]

I wrote a Haskell version that includes two components:

A very efficient function to rank a set of Texas Hold’em hands.

A Monte Carlo situation that gives you the probability of winning each hand from any known amount of information.

It is available here: https://github.com/ghais/poker

[bionsystem]

Not sure if you guys are aware but there are solvers existing (most of which are proprietary) that actually give optimal strategies with every possible hands given a betting pattern. They are used extensively as study tools by professional players.

[SnowHill9902]

Can you link to some projects? Ideally also Haskell or also functional?

[bionsystem]

I use GTO+ which is proprietary.

I just tried this one which works like a charm (just run the exe from the zip in github releases ; even comes pre-loaded with a wide amount of preflop ranges, which seem to come from a previous solve) : https://github.com/bupticybee/TexasSolver

Searching with "poker solver haskell" only seem to show very immature projects.