Superhuman AI for Stratego Using Self-Play Reinforcement Learning and Test-Time Search

Samuel Sokota, Eugene Vinitsky, Hengyuan Hu, J. Zico Kolter, Gabriele Farina
11/10/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Few classical games have been regarded as such significant benchmarks of artificial intelligence as to have justified training costs in the millions of dollars. Among these, Stratego -- a board wargame exemplifying the challenge of strategic decision making under massive amounts of hidden information -- stands apart as a case where such efforts failed to produce performance at the level of top humans. This work establishes a step change in both performance and cost for Stratego, showing that it is now possible not only to reach the level of top humans, but to achieve vastly superhuman level -- and that doing so requires not an industrial budget, but merely a few thousand dollars. We achieved this result by developing general approaches for self-play reinforcement learning and test-time search under imperfect information.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sokota2025superhuman,
  title  = {Superhuman AI for Stratego Using Self-Play Reinforcement Learning and Test-Time Search},
  author = {Samuel Sokota and Eugene Vinitsky and Hengyuan Hu and J. Zico Kolter and Gabriele Farina},
  year   = {2025},
  eprint = {2511.07312},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.07312v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.07312.svg)](https://codeofpaper.com/paper/2511.07312)

Discussion