Deep Reinforcement Learning Xiangqi Player with Monte Carlo Tree Search

Berk Yilmaz, Junyu Hu, Jinsong Liu
6/18/2025
cs.AIcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

This paper presents a Deep Reinforcement Learning (DRL) system for Xiangqi (Chinese Chess) that integrates neural networks with Monte Carlo Tree Search (MCTS) to enable strategic self-play and self-improvement. Addressing the underexplored complexity of Xiangqi, including its unique board layout, piece movement constraints, and victory conditions, our approach combines policy-value networks with MCTS to simulate move consequences and refine decision-making. By overcoming challenges such as Xiangqi's high branching factor and asymmetrical piece dynamics, our work advances AI capabilities in culturally significant strategy games while providing insights for adapting DRL-MCTS frameworks to domain-specific rule systems.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{yilmaz2025deep,
  title  = {Deep Reinforcement Learning Xiangqi Player with Monte Carlo Tree Search},
  author = {Berk Yilmaz and Junyu Hu and Jinsong Liu},
  year   = {2025},
  eprint = {2506.15880},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.15880v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.15880.svg)](https://codeofpaper.com/paper/2506.15880)

Discussion