Papers › ExIt-OOS: Towards Learning from Planning in Imperfect Information Games

ExIt-OOS: Towards Learning from Planning in Imperfect Information Games

30 Aug 2018arXiv:1808.10120archive 2025-07-28

Andy Kitchen, Michela Benedetti

The current state of the art in playing many important perfect information games, including Chess and Go, combines planning and deep reinforcement learning with self-play. We extend this approach to imperfect information games and present ExIt-OOS, a novel approach to playing imperfect information games within the Expert Iteration framework and inspired by AlphaZero. We use Online Outcome Sampling, an online search algorithm for imperfect information games in place of MCTS. While training online, our neural strategy is used to improve the accuracy of playouts in OOS, allowing a learning and planning feedback loop for imperfect information games.

PaperPDFCode

Code

IAARhub/TrucoAnalytics mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Deep Reinforcement LearningReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AlphaZero

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections