Back to results

Virginia Tech

Towards Better Turn-Based Strategy Planning Agents: Turn-Based Evolutionary Tree Search

Abstract

dc:description.abstract

While AI agents surpass human performance in classical board games such as Chess, Go, and Shogi, many complex turn-based strategy (TBS) games, particularly those involving multiple actions per player turn, remain challenging due to their enormous branching factors and long planning horizons. Unlike single-action-per-turn games, TBS games like Civilization or TUBSTAP require sequencing multiple unit-level decisions per turn, resulting in state spaces where conventional algorithms like Monte Carlo Tree Search (MCTS) and Rolling Horizon Evolutionary Algorithms (RHEA) struggle to scale. First, we perform an investigation into state-of-the-art Deep Learning based models for game agents in TUBSTAP. Then, we propose Turn-Based Evolutionary Tree Search (TBETS), a novel hybrid algorithm that combines the depth-oriented selection of MCTS with the population-based variation of evolutionary algorithms. Unlike standard MCTS, TBETS treats each tree node as a turn-start state and each branch as a full multi-action sequence. To manage the wide but shallow tree, TBETS applies evolutionary operations, mutation and crossover, to choose child nodes to search, enabling adaptive exploration in high-dimensional action spaces. In experiments conducted on the TUBSTAP platform, TBETS outperformed state-of-the-art baselines, including M-UCT (i.e., MCTS-based Upper Confidence Bound applied to Trees), RHEA, and Flexible Horizon Evolutionary MCTS (FH-EMCTS). Notably, TBETS achieved a >20% higher winrate over RHEA on large 10-unit maps, and surpassed M-UCT by over 50% on 8-unit scenarios. These results demonstrate that TBETS is a scalable and effective approach for TBS games, particularly as complexity increases.

Degree

thesis:*
Name thesis:degree_name
Master of Science
Level thesis:degree_level
masters
Discipline thesis:degree_discipline
Computer Science & Applications
Department dc:contributor.department
Computer Science and Applications
Grantor dc:publisher
Virginia Tech
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Neller, Taylor
Chairs dc:contributor.committeechair
  • Cho, Jin-Hee
  • Huang, Lifu
Committee member dc:contributor.committeemember
  • Zhou, Dawei

Subjects

dc:subject × 5

Rights

dc:rights
Statement dc:rights
  • In Copyright
Language dc:language.iso
en

Identifiers

dc:identifier.*
Dc Identifier Other
vt_gsexam:44536
OAI identifier oai:identifier
oai:vtechworks.lib.vt.edu:10919/137607

Chain of custody

source
Harvested from
Virginia Tech
Base URL
vtechworks.lib.vt.edu/oai/request
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Neller, Taylor. Towards Better Turn-Based Strategy Planning Agents: Turn-Based Evolutionary Tree Search. masters thesis, Virginia Tech, 2025. https://hdl.handle.net/10919/137607