A postflop solver written in python.
Uses counterfactual regret to create nash equilibrium strategy.
Currently this solver works on river subgames, uses no information abstraction, and is very slow.
- Testing CFR vs MCCFR
- Reducing tree size via information abstraction
- Testing effectiveness of regret-based pruning
- Testing effectiveness of discounting