With most information hidden, the game Stratego

Ars Technica Papers

Summary

A team from CMU, MIT, NYU, and Stanford created Ataraxos, an AI that beat the best Stratego player in history 15-1-4 while training on just 16 GPUs, overcoming the game's massive hidden information and long-horizon challenges that stumped DeepMind's DeepNash.

<p>Deep Blue took down Garry Kasparov at chess in 1997, AlphaGo beat Lee Sedol at Go in 2016, and poker bots have been beating professionals for years. But one classic game called <em>Stratego</em> held out. Even DeepMind, with its exceptional budget, couldn't build a machine that reliably beat the best human players.</p> <p>Now, a team of researchers from Carnegie Mellon, MIT, New York University, and Stanford University has done it. Their AI, called Ataraxos, beat Pim Niemeijer, arguably the best <em>Stratego</em> player of all time, 15 games to one, with four draws. And it took just 16 GPUs and a few thousand dollars to train it.</p> <h2>Hidden armies</h2> <p>In <em>Stratego</em>, each player gets 40 pieces representing military ranks, from a marshal down to a spy, plus bombs and a flag. You win by capturing the opponent's flag. Your opponent knows <em>where</em> your pieces are, but not <em>what</em> they are. Identities are revealed only when two pieces collide in battle—the weaker one is removed, and the identity of the winner is revealed. That makes <em>Stratego</em> an imperfect-information game, just like poker, which computers cracked years ago. “There's something super distinctive about <em>Stratego</em>, which is that it is a massive amount of hidden information that unfolds over a very long time scale,” said Eugene Vinitsky, a researcher at NYU and co-author of the study.</p><p><a href="https://arstechnica.com/science/2026/10/ai-finally-beat-the-best-stratego-player-in-history-and-did-it-on-a-budget/">Read full article</a></p> <p><a href="https://arstechnica.com/science/2026/10/ai-finally-beat-the-best-stratego-player-in-history-and-did-it-on-a-budget/#comments">Comments</a></p>
Original Article
View Cached Full Text

Cached at: 10/01/26, 05:04 PM

# With most information hidden, the game Stratego had stumped AI—until now Source: [https://arstechnica.com/science/2026/10/ai-finally-beat-the-best-stratego-player-in-history-and-did-it-on-a-budget/](https://arstechnica.com/science/2026/10/ai-finally-beat-the-best-stratego-player-in-history-and-did-it-on-a-budget/) Deep Blue took down Garry Kasparov at chess in 1997, AlphaGo beat Lee Sedol at Go in 2016, and poker bots have been beating professionals for years\. But one classic game called*Stratego*held out\. Even DeepMind, with its exceptional budget, couldn’t build a machine that reliably beat the best human players\. Now, a team of researchers from Carnegie Mellon, MIT, New York University, and Stanford University has done it\. Their AI, called Ataraxos, beat Pim Niemeijer, arguably the best*Stratego*player of all time, 15 games to one, with four draws\. And it took just 16 GPUs and a few thousand dollars to train it\. ## Hidden armies In*Stratego*, each player gets 40 pieces representing military ranks, from a marshal down to a spy, plus bombs and a flag\. You win by capturing the opponent’s flag\. Your opponent knows*where*your pieces are, but not*what*they are\. Identities are revealed only when two pieces collide in battle—the weaker one is removed, and the identity of the winner is revealed\. That makes*Stratego*an imperfect\-information game, just like poker, which computers cracked years ago\. “There’s something super distinctive about*Stratego*, which is that it is a massive amount of hidden information that unfolds over a very long time scale,” said Eugene Vinitsky, a researcher at NYU and co\-author of the study\. In some forms of poker, the hidden information is tiny\. In Texas Hold’em, “You only have two hidden cards,” said Gabriele Farina, an MIT computer scientist and another co\-author\. That leaves just 1,326 possible hands, few enough for a machine to weigh them all\. “In*Stratego*, there’s 40 pieces on the board that could be in any order,” Farina said\. That’s more than a decillion possible setups\. Then there’s the game’s length\. “In chess, usually the game lasts 40 moves, but in*Stratego*, a game can easily last 2,000 moves,” Farina said\. On top of that,*Stratego*is a game of bluffing\. Sometimes you move a weak piece as if it were a marshal, just to scare the opponent off\. When players bluff too often, their threats mean nothing; when they never bluff, they become predictable\. That balancing act, the team explains, is what stumped earlier AIs like DeepMind’s DeepNash, introduced in 2022\.

Similar Articles

This game-playing AI is the new champ at Stratego

MIT News — Artificial Intelligence

Researchers from MIT, Carnegie Mellon, NYU, and Stanford developed an AI that decisively defeats top human Stratego players, a game of hidden information, using efficient training methods far cheaper than prior approaches like DeepMind's. The system, published in Nature, generalizes to other strategic games and could aid real-world decision-making under uncertainty such as business negotiations and cybersecurity.