论文标题
常规会台上有效推理
Efficient Reasoning in Regular Boardgames
论文作者
论文摘要
我们介绍了常规的会台游戏（RBG）语言推理的技术方面 - 一种通用的一般游戏玩法（GGP）形式主义，用于具有完美信息的有限确定性游戏类别，以正则表达式的形式编码规则。 RBG是一种研究工具，旨在帮助开发广义算法，用于知识推理，分析，生成，学习和游戏。在所有这些任务中，一般性和效率都很重要。 在第一部分中，本文描述了RBG编译器使用的优化。这些优化的影响范围从1.7到33倍，效率提高了每秒可能的游戏竞赛数量。然后，我们与其他三个现代GGP系统（GDL，Ludii，AI AI）进行了深入的效率比较。我们还包括自己高度优化的特定游戏推理器，以提供最大速度的参考点。我们的实验表明，RBG目前是抽象的一般游戏玩具语言中最快的，其效率可能与依赖于手工制作的特定游戏实现的常见界面系统具有竞争力。最后，我们讨论了类似的计算基准的一些问题和方法。
We present the technical side of reasoning in Regular Boardgames (RBG) language -- a universal General Game Playing (GGP) formalism for the class of finite deterministic games with perfect information, encoding rules in the form of regular expressions. RBG serves as a research tool that aims to aid in the development of generalized algorithms for knowledge inference, analysis, generation, learning, and playing games. In all these tasks, both generality and efficiency are important. In the first part, this paper describes optimizations used by the RBG compiler. The impact of these optimizations ranges from 1.7 to even 33-fold efficiency improvement when measuring the number of possible game playouts per second. Then, we perform an in-depth efficiency comparison with three other modern GGP systems (GDL, Ludii, Ai Ai). We also include our own highly optimized game-specific reasoners to provide a point of reference of the maximum speed. Our experiments show that RBG is currently the fastest among the abstract general game playing languages, and its efficiency can be competitive to common interface-based systems that rely on handcrafted game-specific implementations. Finally, we discuss some issues and methodology of computing benchmarks like this.
