Regular Boardgames

06/08/2017
by   Jakub Kowalski, et al.
0

We present an initial version of Regular Boardgames general game description language. This stands as an extension of Simplified Boardgames language. Our language is designed to be able to express the rules of a majority of popular boardgames including the complex rules such as promotions, castling, en passant, jump captures, liberty captures, and obligatory moves. The language describes all the above through one consistent general mechanism based on regular expressions, without using exceptions or ad hoc rules.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/08/2016

Simplified Boardgames

We formalize Simplified Boardgames language, which describes a subclass ...
01/08/2013

Language ASPf with Arithmetic Expressions and Consistency-Restoring Rules

In this paper we continue the work on our extension of Answer Set Progra...
02/01/2021

A General Framework for the Logical Representation of Combinatorial Exchange Protocols

The goal of this paper is to propose a framework for representing and re...
06/19/2020

Robustness of Pisot-regular sequences

We consider numeration systems based on a d-tuple 𝐔=(U_1,…,U_d) of seque...
02/19/2019

Taking-and-merging games as rewrite games

This work contributes to the study of rewrite games where positions are ...
10/01/2019

A note on the empirical comparison of RBG and Ludii

We present an experimental comparison of the efficiency of three General...
10/15/2021

Zipping Strategies and Attribute Grammars

Strategic term rewriting and attribute grammars are two powerful program...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.