JOURNAL ARTICLE

Reinforcement Learning for Turn-Based Strategy Game

Abstract

Predictability and lack of adaptability have long been recognized as significant challenges in strategy turn-based games. This is due to the prevalent use of heuristic-based approaches in their agent's decision-making. In this paper, we attempt to solve this issue by replacing heuristics with an intelligent agent trained by Reinforcement Learning (RL). We compare the performance of our trained agent against two systemic approaches, Monte Carlo Tree Search (MCTS) and Online Evolutionary Planning (OEP). Experiments show that while RL is vulnerable to play styles that differ sharply from its training data, it is competitive against MCTS but falls short to OEP. This suggests that RL can be a promising approach after further improvement and optimization in future work.

Keywords:
Reinforcement learning Computer science Adaptability Monte Carlo tree search Heuristics Predictability Heuristic Artificial intelligence Machine learning Tree (set theory) Error-driven learning Decision tree Monte Carlo method

Metrics

1
Cited By
0.26
FWCI (Field Weighted Citation Impact)
17
Refs
0.60
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Artificial Intelligence in Games
Physical Sciences →  Computer Science →  Artificial Intelligence
Digital Games and Media
Social Sciences →  Social Sciences →  Sociology and Political Science
Reinforcement Learning in Robotics
Physical Sciences →  Computer Science →  Artificial Intelligence
© 2026 ScienceGate Book Chapters — All rights reserved.