arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.02839cs.AI
收藏

Ludii通用游戏系统的优化播放实现

Optimised Playout Implementations for the Ludii General Game System

Maastricht University(马斯特里赫特大学)

Dennis J. N. J. Soemers, Éric Piette, Matthew Stephenson, Cameron Browne

摘要:

本文介绍了三种不同的优化实现的播放,如常用的游戏算法,如蒙特卡罗树搜索。每个优化的实现都只适用于特定的游戏集,基于它们的规则。Ludii通用游戏系统可以基于其通用游戏描述语言中的游戏描述自动推断任何优化的实现方式是否适用。一项实证评估表明,在标准实现的基础上,速度有了很大的提高,在Ludii的145个不同游戏中,运行播放速度的中位数是标准实现的5.08倍,其中一个优化的实现是适用的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑