Lune

NeurIPS2021Top-tier venue

Deep Synoptic Monte-Carlo Planning in Reconnaissance Blind Chess

Gregory Clark

2021Year
10Citations

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.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

lune papers fulltext a38fe1f6-ca66-4f72-813f-890ad3320318

Builds on2

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines