Back to Search Start Over

Optimised Playout Implementations for the Ludii General Game System

Authors :
Dennis J. N. J. Soemers
Éric Piette
Matthew Stephenson
Cameron Browne
RS: FSE DACS
Dept. of Advanced Computing Sciences
RS: FSE DACS Mathematics Centre Maastricht
Piette, Eric
Source :
ADVANCES IN COMPUTER GAMES, ACG 2021, 223-234, STARTPAGE=223;ENDPAGE=234;TITLE=ADVANCES IN COMPUTER GAMES, ACG 2021, Lecture Notes in Computer Science, Lecture Notes in Computer Science-Advances in Computer Games, Lecture Notes in Computer Science ISBN: 9783031114878, Advances in Computer Games (ACG 2021)
Publication Year :
2021

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.<br />Advances in Computer Games (ACG) 2021

Details

Language :
English
ISBN :
978-3-031-11487-8
978-3-031-11488-5
ISSN :
03029743 and 16113349
ISBNs :
9783031114878 and 9783031114885
Database :
OpenAIRE
Journal :
ADVANCES IN COMPUTER GAMES, ACG 2021, 223-234, STARTPAGE=223;ENDPAGE=234;TITLE=ADVANCES IN COMPUTER GAMES, ACG 2021, Lecture Notes in Computer Science, Lecture Notes in Computer Science-Advances in Computer Games, Lecture Notes in Computer Science ISBN: 9783031114878, Advances in Computer Games (ACG 2021)
Accession number :
edsair.doi.dedup.....81faff30ed52485dba83e4898833777d