pith. sign in

arxiv: 1606.02645 · v2 · pith:Y4YO7ZTUnew · submitted 2016-06-08 · 💻 cs.AI

Simplified Boardgames

classification 💻 cs.AI
keywords boardgameslanguagerulessimplifiedarbitraryboardconcisedescribes
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.