# Optimised Playout Implementations for the Ludii General Game System

arXiv: https://arxiv.org/abs/2111.02839 · HTML: https://mlsanity.com/paper/2111.02839/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 3 of its 22 references that are in the map.
- First posted on arXiv 4 Nov 2021.

## Builds on (most cited first, 3 of 3)

- [Ludii -- The Ludemic General Game System](https://mlsanity.com/paper/1905.05013/) (2019)
- [Efficient Reasoning in Regular Boardgames](https://mlsanity.com/paper/2006.08295/) (2020)
- [Biasing MCTS with Features for General Games](https://mlsanity.com/paper/1903.08942/) (2019)

## Built on by (most cited first, 1 of 1)

- [Ludax: A GPU-Accelerated Domain Specific Language for Board Games](https://mlsanity.com/paper/2506.22609/) (2025)

## Abstract (arXiv)

This paper describes three different optimised implementations of playouts, as commonly used by game-playing algorithms such as Monte-Carlo Tree Search. Each of the optimised implementations is applicable only to specific sets of games, based on their rules. The Ludii general game system can automatically infer, based on a game's description in its general game description language, whether any optimised implementations are applicable. An empirical evaluation demonstrates major speedups over a standard implementation, with a median result of running playouts 5.08 times as fast, over 145 different games in Ludii for which one of the optimised implementations is applicable.