AIJun 8, 2016
Simplified Boardgames
arXiv:1606.02645v2
AI Analysis
This work addresses the problem of representing board game rules for computational systems, but it is incremental as it builds on existing formalization efforts.
The authors formalized the Simplified Boardgames language to describe a subclass of arbitrary board games, using regular expressions to make rules machine-processable and human-readable.
We formalize Simplified Boardgames language, which describes a subclass of arbitrary board games. The language structure is based on the regular expressions, which makes the rules easily machine-processable while keeping the rules concise and fairly human-readable.