PyTAG: Tabletop Games for Multi-Agent Reinforcement Learning

Martin Balla, George E. M. Long, James Goodman, Raluca D. Gaina, Diego Perez-Liebana
5/28/2024
cs.AI

No official code found. Best implementation: martinballa/PyTAG (26 stars, MIT, last commit 2025-11-09).

Abstract

Modern Tabletop Games present various interesting challenges for Multi-agent Reinforcement Learning. In this paper, we introduce PyTAG, a new framework that supports interacting with a large collection of games implemented in the Tabletop Games framework. In this work we highlight the challenges tabletop games provide, from a game-playing agent perspective, along with the opportunities they provide for future research. Additionally, we highlight the technical challenges that involve training Reinforcement Learning agents on these games. To explore the Multi-agent setting provided by PyTAG we train the popular Proximal Policy Optimisation Reinforcement Learning algorithm using self-play on a subset of games and evaluate the trained policies against some simple agents and Monte-Carlo Tree Search implemented in the Tabletop Games framework.

View on arXivView PDF

Code Implementations(1)

martinballa/PyTAGCommunity100%
MIT
2613PythonSep 12, 202211 months agoMIT

Similar Papers

Cite this paper

@article{balla2024pytag,
  title  = {PyTAG: Tabletop Games for Multi-Agent Reinforcement Learning},
  author = {Martin Balla and George E. M. Long and James Goodman and Raluca D. Gaina and Diego Perez-Liebana},
  year   = {2024},
  eprint = {2405.18123},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.18123v1}
}

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/2405.18123.svg)](https://codeofpaper.com/paper/2405.18123)

Discussion