bupticybee/TexasSolver

🚀 A very efficient Texas Holdem GTO solver :spades::hearts::clubs::diamonds:

What it solves

TexasSolver provides a high-performance tool for calculating optimal strategies in Texas Hold'em and Short Deck poker. It allows players and researchers to solve game trees to find the mathematically correct way to play specific hands and scenarios.

How it works

Written in C++, the project implements a game-solving algorithm optimized for speed and memory efficiency. It supports both a GUI for ease of use and a console version for programmatic access, including the ability to dump strategies into JSON files and support for cross-language calls.

Who it’s for

It is designed for poker players, analysts, and developers who need an efficient, open-source alternative to proprietary solvers like PioSolver.

Highlights

  • Supports both Texas Hold'em and Short Deck poker.
  • Cross-platform compatibility with Windows, macOS, and Linux.
  • High performance, exceeding PioSolver's speed on flop trees with 1-2 bets plus all-in.
  • Offers both a graphical user interface (GUI) and a console-based interface.

Related

  • Project
    a9876543245/DEEPFOLD-SOLVER

    A GPU-accelerated GTO poker solver that uses a DCFR engine to calculate equilibrium strategies with advanced analysis tools for blockers and runouts.

  • Project
    uoftcprg/pokerkit

    A pure Python library for simulating various poker variants, evaluating hands, and conducting statistical analysis, designed for AI development and tool creation.

  • Project
    ceres-solver/ceres-solver

    Ceres Solver is a C++ library for modeling and solving large, complex non-linear least squares and general unconstrained optimization problems.

  • Project
    rburkholder/trade-frame

    A C++ framework for high-capacity, low-latency trading that provides specialized tools for tracking option combination orders and real-time Greeks calculation.

  • Project
    Simple-Robotics/proxsuite

    A collection of numerically robust and efficient numerical solvers for Linear and Quadratic Programs, designed for high-performance robotics and optimization tasks.