Solver-Guided LLMs Improve Mixed-Strategy Game Play

Han Wang, Philippe Beardsell, Boning Li, Aaron Sasmita, Shuai Li, Hongyuan Zha, Baoxiang Wang· August 10, 2026 View original

Key takeaways

  • LLMs can improve game reasoning by using solver output instead of human data.
  • The Mixed-Strategy Decision Tree (MDT) translates optimal equilibria into sparse rules.
  • This approach significantly reduces the distance to equilibrium in complex games.
  • It enables LLMs to learn more robust and rational strategic behaviors.

Who benefits

GamingFinanceDefenseAutonomous SystemsLogistics

Summary

This research demonstrates how to enhance Large Language Models' (LLMs) reasoning in complex games, particularly those with mixed-strategy equilibria, by guiding them with solver output rather than human data. The proposed Mixed-Strategy Decision Tree (MDT) articulates optimal equilibrium into sparse rules, significantly reducing the distance to equilibrium in games like No-Limit Texas Hold'em.

Large Language Models (LLMs) often struggle with equilibrium reasoning in complex games, especially when human data, which is frequently biased towards pure strategies, is used for training. This paper explores a novel approach to improve LLM game-playing capabilities by leveraging solver output instead of human demonstrations. The researchers introduce the Mixed-Strategy Decision Tree (MDT), a method that translates the silent optimality of game equilibria into sparse, understandable strategic rules. By querying a solver oracle for over 250 million mixed-strategy decisions in No-Limit Texas Hold'em, the MDT, combined with other techniques, significantly reduced the L1 distance to equilibrium by 52.6% across various LLM configurations. This solver-guided approach allows for extending input to arbitrary new states and continuations, offering a more robust and accurate way to teach LLMs optimal game theory strategies, as validated in complete River-endgame and Liar's Dice experiments.

Why it matters

Professionals developing AI agents for strategic decision-making, gaming, or complex simulations can use this method to train LLMs that adhere more closely to optimal game theory, leading to more robust and rational agent behavior.

How to implement this in your domain

  1. 1Identify strategic decision-making tasks in your domain that can be framed as games with mixed-strategy equilibria.
  2. 2Develop or integrate a game solver capable of generating optimal mixed-strategy decisions for these tasks.
  3. 3Implement the Mixed-Strategy Decision Tree (MDT) approach to distill solver output into interpretable rules for LLMs.
  4. 4Train or fine-tune LLMs using these solver-generated rules and evaluate their performance against human-data-trained models.

Original post by Han Wang, Philippe Beardsell, Boning Li, Aaron Sasmita, Shuai Li, Hongyuan Zha, Baoxiang Wang

"arXiv:2608.06741v1 Announce Type: new Abstract: Reasoning in large language models (LLMs) is often grounded in human text, human demonstrations, and human-generated rationales. For equilibrium reasoning in complex games, however, relying on human data can be suboptimal. In fact,…"

View on X

Originally posted by Han Wang, Philippe Beardsell, Boning Li, Aaron Sasmita, Shuai Li, Hongyuan Zha, Baoxiang Wang on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses