Episode Summary
Executive Summary: Noam Brown explains how superhuman AI in poker and Diplomacy was achieved not by raw neural nets alone, but by combining self-play, search, regret minimization, and human data. The discussion contrasts zero-sum games with socially complex, natural-language negotiation, and argues that human-compatible planning is key for AI in real-world interaction, trust, and strategy.
Main Topics: No-Limit Poker as a benchmark for game-solving AI: Brown describes why no-limit Texas Hold’em is harder than chess: imperfect information, bluffing, betting balance, and huge strategic space. He explains how Libratus and Pluribus achieved superhuman performance by approximating Nash equilibrium and using search. Nash equilibrium, regret minimization, and self-play: He breaks down Nash equilibrium and counterfactual regret minimization as the core theoretical tools behind poker AIs. The idea is to learn balanced mixed strategies through self-play that remain robust even when opponents know the policy. The role of search in AI performance: A major thesis is that search/planning is underestimated. Brown argues that search was essential in poker, chess, and Go, and that even strong neural nets are much weaker without planning at test time. From heads-up to six-player poker: The jump from two-player to six-player poker was enabled by depth-limited search and better scaling, showing that algorithmic improvements—not just more compute—can drastically reduce training cost and broaden applicability. Diplomacy as a harder, more human game: Diplomacy adds seven players, alliances, deception, and natural-language negotiation. Brown argues it is closer to the real world than previous benchmarks because success requires understanding human trust and cooperation, not just optimal play. Cicero: language + strategy + human compatibility: Cicero combines a language model with strategic planning. It uses human data to anchor behavior, then conditions generation on intents derived from reinforcement learning and search, while filtering for nonsense and harmful deception. Ethics, trust, and real-world implications: The conversation closes on risks and benefits of AI that can negotiate, persuade, and even deceive. Brown emphasizes trust, anti-AI bias, cheating detection, and the potential for AI to improve human strategy, education, and future negotiation systems.
Key Arguments: Poker AI succeeded because the core challenge was not feature extraction but balancing probabilities, bluffing frequencies, and hidden information. Nash equilibrium gives a strategy that is unbeatable in expectation in two-player zero-sum games, but this framework weakens outside that setting. Search at test time is crucial; even highly capable neural nets are far less effective without planning ahead. In poker, overbets and other seemingly “crazy” moves are not chaos for its own sake; they can be optimal because they create difficult decisions for opponents. Six-player poker remained solvable in practice because it is still highly adversarial, but Diplomacy required human data because pure self-play would learn non-human communication and coordination patterns. Cicero’s success came from combining self-play and planning with a human-anchored policy and a language model conditioned on strategic intents. In Diplomacy, trust is more important than deception; obvious lying hurts long-run performance because players stop cooperating. Human-like AI can help with training, games, and negotiation, but it also raises concerns about cheating, manipulation, and misuse in real-world interactions.
Data Points: Hands played in Libratus competition: 120,000 hands - Libratus played top human heads-up no-limit Texas Hold’em players over 20 days. Prize money at stake: $200,000 - Competition incentive pool for the 2017 Libratus match. Bot winnings in Libratus match: close to $2 million - Libratus won against professional heads-up players over the course of the match. Decision points in heads-up no-limit Texas Hold’em: 10^161 - Brown cites the scale of the game’s search space. Players in six-player poker: 6 players - Pluribus extended superhuman poker AI from heads-up to multiplayer poker. Approximate cost of Libratus final training run: $100,000 - Brown contrasts the compute cost of Libratus with later improvements. Approximate cost of Pluribus final training run: less than $150 on AWS - Algorithmic improvements and depth-limited search made Pluribus dramatically cheaper. Poker hands in a standard starting deal: 52 choose 2 = 1,326 combinations - Brown uses this to explain hidden information and hand-range reasoning. Human-card dataset for Diplomacy: 50,000 games - Used to train human-compatible behavior for Cicero. Message count in Diplomacy dataset: over 10 million messages - Large-scale language data for negotiation and persuasion modeling. Cicero evaluation size: 40 games - Bot played with real humans online in Diplomacy. Cicero ranking: 2nd out of all players with 5+ games - Performance result in the Diplomacy study. Approximate total player pool in evaluation: about 80 players - Brown describes the online Diplomacy tournament setting. Players with 5+ games in evaluation: 19 - Subset used for ranking comparison with Cicero. Overbet example: $20,000 into a $1,000 pot - Illustrates extreme betting sizes that pressured human opponents in poker. Tournament length: 20 days - Duration of the Libratus human-vs-bot match. Self-play training data source: webdiplomacy.net - Primary site supplying Diplomacy game logs for training.
Pivotal Quotes: "The whole secret lies in confusing the enemy so that he cannot fathom our real intent." — Lex Friedman (closing quote from Sun Tzu): Used as the episode’s final framing for strategy, deception, and intent. "If you play it, you are guaranteed to not lose in expectation no matter what your opponent does." — Noam Brown: Explaining Nash equilibrium in two-player zero-sum games like poker. "What we found is that the human players were really struggling with that decision, that's when I realized, oh, actually, this is maybe a good thing to do after all." — Noam Brown: Reflecting on the overbet strategy that put opponents into difficult situations.
Implications: The episode suggests the next wave of AI will pair strategic planning with human-compatible communication. This could improve games, negotiation tools, training systems, and human-AI collaboration, while also sharpening concerns about deception, cheating, and trust.
From the Episode
I think one of the challenges in life is figuring out exactly what that reward function is. Sometimes it's pretty hard to specify. The same way that trying to handcraft the optimal policy in a game like chess is really difficult. It's not so clear cut what the reward function is for life. I think one day AI will figure it out. And I wonder what that would be. Until then, I just really appreciate the kind of work you're doing. And it's really fascinating taking a leap into a more and more real world-like problem space and just achieving incredible results by applying reinforcement learning. No, since I saw your work on poker, you've been a constant inspiration. It's an honor to get to finally talk to you. And this is really fun. Thanks for having me. Thanks for listening to this conversation with No Brown. To support this podcast, please check out our sponsors in the description. And now let me leave you with some words from San Tzu and the Art of War. The whole secret lies in confusing the enemy so that he cannot fathom our real intent. Thank you for listening and hope to see you next time.
This gets into the concept of a Nash equilibrium. What is a Nash equilibrium? Okay. So in any finite two-player zero-sum game, there is an optimal strategy that if you play it, you are guaranteed to not lose an expectation no matter what your opponent does. And this is kind of a radical concept to a lot of people, but it's true in chess, it's true in poker, it's true in any finite two-player zero-sum game. And to give some intuition for this, you can think of rock, paper, scissors. Paper, scissors. If you randomly choose between throwing rock, paper, and scissors with equal probability, then no matter what your opponent does, you are not going to lose an expectation. You're not going to lose an expectation in the long run. Now, the same is true for poker. There exists some strategy, some really complicated strategy that if you play that, you are guaranteed to not lose money in the long run. And I should say this is for two-player poker. Six-player poker is a different story. Yeah, it's a beautiful giant mess. When you say in expectation, you're guaranteed not to.
We're leveraging the fact that we have this general data set of dialogue and communication from a breadth of the internet. That is a big step in that direction. We're not 100% there, but we're getting closer at least. So, if we actually return back to poker and chess, are some of the ideas that you're learning here with diplomacy? Could you construct AI systems that play like humans? Like, make for a fun opponent? In a game of chess? Yeah, absolutely. We've already started looking into this direction a bit. So we tried to use the techniques that we've developed for diplomacy to make chess and go AIs. And what we found is that it led to much more human-like, strong chess and go players. The way that AIs like stockfish today play is in a very inhuman style. It's very strong, but it's very different from how humans play. And so we can take the techniques that we've developed for diplomacy, we do something. Similar in chess and go, and we end up with a bot that's both strong and human-like.
About Lex Fridman Podcast
Conversations about science, technology, history, philosophy and the nature of intelligence, consciousness, love, and power. Lex is an AI researcher at MIT and beyond.