activity
20162025
most citedSimplified Boardgames

1 citations · 2 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2025

Generalized Proof-Number Monte-Carlo Tree Search

Jakub Kowalski, Dennis J. N. J. Soemers, Szymon Kosakowski +1

This paper presents Generalized Proof-Number Monte-Carlo Tree Search: a generalization of recently proposed combinations of Proof-Number Search (PNS) with Monte-Carlo Tree Search (…

cs.AI20251 cited

Towards Explaining Monte-Carlo Tree Search by Using Its Enhancements

Jakub Kowalski, Mark H. M. Winands, Maksymilian Wiśniewski +2

Typically, research on Explainable Artificial Intelligence (XAI) focuses on black-box models within the context of a general policy in a known, specific domain. This paper advocate…

cs.LG2023

Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications

Michal Bartoszkiewicz, Jan Chorowski, Adrian Kosowski +8

We present Pathway, a new unified data processing framework that can run workloads on both bounded and unbounded data streams. The framework was created with the original motivatio…

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.AI20161 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…