Optimised Playout Implementations for the Ludii General Game System

D.J.N.J. Soemers*, E. Piette, M. Stephenson, C. Browne

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Abstract

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.
Original languageEnglish
Title of host publicationAdvances in Computer Games - 17th International Conference, ACG 2021, Revised Selected Papers
EditorsCameron Browne, Akihiro Kishimoto, Jonathan Schaeffer
PublisherSpringer International Publishing AG
Pages223-234
Number of pages12
ISBN (Print)9783031114878
DOIs
Publication statusPublished - 2022
Event17th International Conference on Advances in Computer Games (ACG) - Virtual
Duration: 23 Nov 202125 Nov 2021

Publication series

SeriesLecture Notes in Computer Science
Volume13262
ISSN0302-9743

Conference

Conference17th International Conference on Advances in Computer Games (ACG)
Period23/11/2125/11/21

Keywords

  • Playouts
  • General Game Playing
  • Ludii

Fingerprint

Dive into the research topics of 'Optimised Playout Implementations for the Ludii General Game System'. Together they form a unique fingerprint.

Cite this