Deep Synoptic Monte-Carlo Planning in Reconnaissance Blind Chess
Gregory Clark
Abstract
This paper introduces deep synoptic Monte Carlo planning (DSMCP) for large imperfect information games. The algorithm constructs a belief state with an unweighted particle filter and plans via playouts that start at samples drawn from the belief state. The algorithm accounts for uncertainty by performing inference on "synopses," a novel stochastic abstraction of information states. DSMCP is the basis of the program Penumbra, which won the official 2020 reconnaissance blind chess competition versus 33 other programs. This paper also evaluates algorithm variants that incorporate caution, paranoia, and a novel bandit algorithm. Furthermore, it audits the synopsis features used in Penumbra with per-bit saliency statistics. Recent advancements in imperfect information games are also remarkable. Several programs have reached superhuman performance in Poker [
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a38fe1f6-ca66-4f72-813f-890ad3320318Builds on2
Related papers
- General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chessBrian Zhang, Tuomas SandholmICLR 2026 · 13 citations
- Code World Models for General Game PlayingWolfgang Lehrach, Daniel Hennes, Miguel Lazaro-Gredilla, Xinghua Lou et al.ICLR 2026 · 27 citations
- The Update-Equivalence Framework for Decision-Time PlanningSamuel Sokota, Gabriele Farina, David J. Wu, Hengyuan Hu et al.ICLR 2024 · 5 citations
- Implicit Search via Discrete Diffusion: A Study on ChessJiacheng Ye, Zhenyu Wu, Jiahui Gao, Zhiyong Wu et al.ICLR 2025
- Subgame solving without common knowledgeBrian Hu Zhang, Tuomas SandholmNeurIPS 2021 · 21 citations
