Search Results for author:
Found 16 papers, 6 papers with code
Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract)
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.
Pathway: a fast and flexible unified stream data processing framework for analytical and Machine Learning applications
The framework was created with the original motivation of resolving challenges faced when analyzing and processing data from the physical economy, including streams of data generated by IoT and enterprise systems.
Summarizing Strategy Card Game AI Competition
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.
Introducing Tales of Tribute AI Competition
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.
Proof Number Based Monte-Carlo Tree Search
Furthermore, we extend this new algorithm to properly address games with draws, like Awari, by adding an additional layer of PNS on top of the MCTS tree.
Developing a Successful Bomberman Agent
In this paper, we study AI approaches to successfully play a 2-4 players, full information, Bomberman variant published on the CodinGame platform.
Split Moves for Monte-Carlo Tree Search
These decisions can be viewed as separate moves, which is already a common practice in multi-action games for efficiency reasons.
Evolving Evaluation Functions for Collectible Card Game AI
One simpler and more limited, based on a vector of weights that are used in a linear combination of predefined game features.
Efficient Reasoning in Regular Boardgames
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 perfect information, encoding rules in the form of regular expressions.
Experimental Studies in General Game Playing: An Experience Report
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 systems designed to play games described by different formalisms.
Evolutionary Approach to Collectible Card Game Arena Deckbuilding using Active Genes
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 TES: Legends.
A note on the empirical comparison of RBG and Ludii
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 Description Language (GDL) propnet.
Regular Boardgames
We propose a new General Game Playing (GGP) language called Regular Boardgames (RBG), which is based on the theory of regular languages.
Text-based Adventures of the Golovin AI Agent
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 intelligently in text-described environments.
Simplified Boardgames
We formalize Simplified Boardgames language, which describes a subclass of arbitrary board games.
Procedural Content Generation for GDL Descriptions of Simplified Boardgames
We present initial research towards procedural generation of Simplified Boardgames and translating them into an efficient GDL code.
