mlsanityData to 14 Oct 2026

Alpha-Mini: Minichess Agent with Deep Reinforcement Learning

arXiv 2112.13666 ↗First posted 22 Dec 2021cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We train an agent to compete in the game of Gardner minichess, a downsized variation of chess played on a 5x5 board. We motivated and applied a SOTA actor-critic method Proximal Policy Optimization with Generalized Advantage Estimation. Our initial task centered around training the agent against a random agent. Once we obtained reasonable performance, we then adopted a version of iterative policy improvement adopted by AlphaGo to pit the agent against increasingly stronger versions of itself, and evaluate the resulting performance gain. The final agent achieves a near (.97) perfect win rate against a random agent. We also explore the effects of pretraining the network using a collection of positions obtained via self-play.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 8 references that are in the map. First posted on arXiv 22 Dec 2021.

Builds on

4 of 8 references.

References · 4

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2015Trust Region Policy Optimizationcited by 2,580
  3. 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 734
  4. 2017DeepChess: End-to-End Deep Neural Network for Automatic Learning in Chesscited by 14

Built on by

Not cited yet.