bupticybee/TexasSolver

What it solves

TexasSolver provides a high-performance computational tool for solving Texas Hold'em and short deck poker games. It calculates optimal strategies (Game Theory Optimal or GTO) to help players understand the mathematically correct way to play specific hand scenarios.

How it works

Written in C++, the solver processes game trees—specifically those involving 1-2 bets plus an all-in—to determine the most efficient strategy. It is an optimized version of a previous Java implementation, designed to reduce memory usage and increase execution speed across Windows, macOS, and Linux.

Who it’s for

It is designed for poker players and developers who need a fast, accurate solver for game analysis and strategy development, with options for both a graphical user interface (GUI) and a console-based interface.

Highlights

• High Efficiency: Outperforms Piosolver on the flop for specific game trees.
• Cross-Platform: Fully compatible with Windows, macOS, and Linux.
• Cross-Language: Supports cross-language calls for integration into other software.
• Flexible Output: Ability to dump calculated strategies into JSON files.
• Game Support: Works for both standard Texas Hold'em and short deck variants.