Since I have written an application which approximates a nash equilibrium through fictitious play of a game where two players play the turn and river with defined initial hand ranges I can add some data to the discussion.
The algorithm is not optimized and to reduce the strategy space and save computation time it uses the following simplifications:
- Betting per round is capped after two bets
- The player out of position alway checks the turn
Because of (2) I don't know if betting the turn 100% is better than a mixed strategy consisting of k/f, k/c and k/r.
Initial ranges: (If you don't agree with these ranges just give me new ones.)
River strategy: (The numbers in the status line are the expected values in small bets if you play against the approximated nash equilibrium of the player in position)