Regular Boardgames
원문 초록
We propose a new General Game Playing (GGP) language called Regular Boardgames (RBG), which is based on the theory of regular languages. The objective of RBG is to join key properties as expressiveness, efficiency, and naturalness of the description in one GGP formalism, compensating certain drawbacks of the existing languages. This often makes RBG more suitable for various research and practical developments in GGP. While dedicated mostly for describing board games, RBG is universal for the class of all finite deterministic turn-based games with perfect information. We establish foundations of RBG, and analyze it theoretically and experimentally, focusing on the efficiency of reasoning. Regular Boardgames is the first GGP language that allows efficient encoding and playing games with complex rules and with large branching factor (e.g.\ amazons, arimaa, large chess variants, go, international checkers, paper soccer).
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
Vision Language Models are Biased
4Hammer: a board-game reinforcement learning environment for the hour long time frame
Playing Non-Embedded Card-Based Games with Reinforcement Learning
ZeroSumEval: An Extensible Framework For Scaling LLM Evaluation with Inter-Model Competition
Playing Hex and Counter Wargames using Reinforcement Learning and Recurrent Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.