Zobrazeno 1 - 10
of 233
pro vyhledávání: '"Kowalski, Jakub"'
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 rules. The dataset generation uses MCTS playing instead of self-play;
Externí odkaz:
http://arxiv.org/abs/2312.14121
Autor:
Bartoszkiewicz, Michal, Chorowski, Jan, Kosowski, Adrian, Kowalski, Jakub, Kulik, Sergey, Lewandowski, Mateusz, Nowicki, Krzysztof, Piechowiak, Kamil, Ruas, Olivier, Stamirowska, Zuzanna, Uznanski, Przemyslaw
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 motivation of resolving challenges faced when analyzing and processing data fro
Externí odkaz:
http://arxiv.org/abs/2307.13116
Autor:
Kowalski, Jakub, Miernik, Radosław
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 algorithm development. The game was used in a number of events, inclu
Externí odkaz:
http://arxiv.org/abs/2305.11814
The model of population protocols provides a universal platform to study distributed processes driven by pairwise interactions of anonymous agents. While population protocols present an elegant and robust model for randomized distributed computation,
Externí odkaz:
http://arxiv.org/abs/2305.08460
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 Scrolls Online. Currently, there is no other AI competition covering
Externí odkaz:
http://arxiv.org/abs/2305.08234
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 applied for decision making in a range of domains. We define three area
Externí odkaz:
http://arxiv.org/abs/2303.09449
Autor:
Kowalczyk, Dominik, Kowalski, Jakub, Obrzut, Hubert, Maras, Michał, Kosakowski, Szymon, Miernik, Radosław
In this paper, we study AI approaches to successfully play a 2-4 players, full information, Bomberman variant published on the CodinGame platform. We compare the behavior of three search algorithms: Monte Carlo Tree Search, Rolling Horizon Evolution,
Externí odkaz:
http://arxiv.org/abs/2203.09608
Autor:
Kowalski, Jakub, Mika, Maksymilian, Pawlik, Wojciech, Sutowicz, Jakub, Szykuła, Marek, Winands, Mark H. M.
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 efficiency reasons. Such division of a player move into a sequence of
Externí odkaz:
http://arxiv.org/abs/2112.07761
Autor:
Gordziej-Zagórowska, Małgorzata, Migda, Wojciech, Lasowicz, Natalia, Deniziak, Patryk, Bera, Alicja, Kowalski, Jakub
Publikováno v:
In Journal of Constructional Steel Research December 2024 223
Autor:
Miernik, Radosław, Kowalski, Jakub
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 opponent used to test the model. We compared three representations. One simp
Externí odkaz:
http://arxiv.org/abs/2105.01115