Simplified Boardgames
Jakub Kowalski, Jakub Sutowicz, Marek Szyku{\l}a
TL;DR
This paper introduces Simplified Boardgames, a formal language based on regular expressions that describes a subset of board games, making rules easy to process and understand.
Contribution
It presents a new formal language for describing board games that balances machine-processability with human readability.
Findings
The language enables concise representation of game rules.
Rules are easily machine-processable due to regular expression basis.
The formalization facilitates computational analysis of board games.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Artificial Intelligence in Games · Algorithms and Data Compression