Estimation of distribution genetic programming (EDA-GP) algorithms are metaheuristics where sampling new solutions from a learned probabilistic model replaces the standard mutation and recombination operators of genetic programming (GP). This paper …
We present a new method, Synthesis through Unification Genetic Programming (STUN GP), which synthesizes provably correct programs using a Divide and Conquer approach. This method first splits the input space by undergoing a discovery phase that uses …
Digital collectible card games are not only a growing part of the video game industry, but also an interesting research area for the field of computational intelligence. This game genre allows researchers to deal with hidden information, uncertainty …
Generative adversary networks (GANs) suffer from training pathologies such as instability and mode collapse. These pathologies mainly arise from a lack of diversity in their adversarial interactions. Evolutionary generative adversarial networks apply …
In this paper, we introduce a Monte-Carlo tree search (MCTS) approach for the game "Hearthstone: Heroes of Warcraft". We argue that, in light of the challenges posed by the game (such as uncertainty and hidden information), Monte Carlo tree search …
Digital collectible card games, as partially observable games based on alternating turns, such as HearthStone, have been the most played card games in recent years, where the main challenge is the creation of strategies capable of subdue the enemy's …