Deep Synoptic Monte-Carlo Planning in Reconnaissance Blind ChessDownload PDF

21 May 2021, 20:42 (edited 28 Jan 2022)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: reconnaissance blind chess, imperfect information, deep learning, imitation learning, planning, uncertainty
  • TL;DR: This paper describes a competition-winning Reconnaissance Blind Chess program.
  • 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.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
10 Replies

Loading