1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.AI2021
Split Moves for Monte-Carlo Tree Search
Jakub Kowalski, Maksymilian Mika, Wojciech Pawlik +3
In many games, moves consist of several decisions made by the player. These decisions can be viewed as separate moves, which is already a common practice in multi-action games for…
cs.FL2017
Complexity of regular bifix-free languages
Robert Ferens, Marek Szykuła
We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that th…
cs.AI2016★ 1 cited
Simplified Boardgames
Jakub Kowalski, Jakub Sutowicz, Marek Szykuła
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…