14 citations · 48 across the 18 of their papers we have counts for
19 papers
Regular Games -- an Automata-Based General Game Playing Language
Radosław Miernik, Marek Szykuła, Jakub Kowalski +3
We propose a new General Game Playing (GGP) system called Regular Games (RG). The main goal of RG is to be both computationally efficient and convenient for game design. The system…
Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract)
Michał Maras, Michał Kępa, Jakub Kowalski +1
We develop a method of adapting the AlphaZero model to General Game Playing (GGP) that focuses on faster model generation and requires less knowledge to be extracted from the game…
Summarizing Strategy Card Game AI Competition
Jakub Kowalski, Radosław Miernik
This paper concludes five years of AI competitions based on Legends of Code and Magic (LOCM), a small Collectible Card Game (CCG), designed with the goal of supporting research and…
Introducing Tales of Tribute AI Competition
Jakub Kowalski, Radosław Miernik, Katarzyna Polak +2
This paper presents a new AI challenge, the Tales of Tribute AI Competition (TOTAIC), based on a two-player deck-building card game released with the High Isle chapter of The Elder…
Proof Number Based Monte-Carlo Tree Search
Jakub Kowalski, Elliot Doe, Mark H. M. Winands +2
This paper proposes a new game-search algorithm, PN-MCTS, which combines Monte-Carlo Tree Search (MCTS) and Proof-Number Search (PNS). These two algorithms have been successfully a…
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…
Evolving Evaluation Functions for Collectible Card Game AI
Radosław Miernik, Jakub Kowalski
In this work, we presented a study regarding two important aspects of evolving feature-based game evaluation functions: the choice of genome representation and the choice of oppone…
Efficient Reasoning in Regular Boardgames
Jakub Kowalski, Radosław Miernik, Maksymilian Mika +4
We present the technical side of reasoning in Regular Boardgames (RBG) language -- a universal General Game Playing (GGP) formalism for the class of finite deterministic games with…
Experimental Studies in General Game Playing: An Experience Report
Jakub Kowalski, Marek Szykuła
We describe nearly fifteen years of General Game Playing experimental research history in the context of reproducibility and fairness of comparisons between various GGP agents and…
Evolutionary Approach to Collectible Card Game Arena Deckbuilding using Active Genes
Jakub Kowalski, Radosław Miernik
In this paper, we evolve a card-choice strategy for the arena mode of Legends of Code and Magic, a programming game inspired by popular collectible card games like Hearthstone or T…
A note on the empirical comparison of RBG and Ludii
Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz +1
We present an experimental comparison of the efficiency of three General Game Playing systems in their current versions: Regular Boardgames (RBG 1.0), Ludii~0.3.0, and a Game Descr…
Regular Boardgames
Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz +1
We propose a new General Game Playing (GGP) language called Regular Boardgames (RBG), which is based on the theory of regular languages. The objective of RBG is to join key propert…
Text-based Adventures of the Golovin AI Agent
Bartosz Kostka, Jaroslaw Kwiecien, Jakub Kowalski +1
The domain of text-based adventure games has been recently established as a new challenge of creating the agent that is both able to understand natural language, and acts intellige…
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…
Experiments with Synchronizing Automata
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds…
Procedural Content Generation for GDL Descriptions of Simplified Boardgames
Jakub Kowalski, Marek Szykuła
We present initial research towards procedural generation of Simplified Boardgames and translating them into an efficient GDL code. This is a step towards establishing Simplified B…
A New Heuristic Synchronizing Algorithm
Jakub Kowalski, Marek Szykuła
We present a new heuristic algorithm finding reset words. The algorithm called CutOff-IBFS is based on a simple idea of inverse breadth-first-search in the power automaton. We perf…
The Černý conjecture for small automata: experimental report
Jakub Kowalski, Marek Szykuła
We present a report from a series of experiments involving computation of the shortest reset words for automata with small number of states. We confirm that the Černý conjecture is…
A Fast Algorithm Finding the Shortest Reset Words
Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła
In this paper we present a new fast algorithm finding minimal reset words for finite synchronizing automata. The problem is know to be computationally hard, and our algorithm is ex…