Abstract Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-
playing bots or solving sequential decision problems. The method relies on intelligent tree …

This paper reviews the field of Game AI, which not only deals with creating agents that can
play a certain game, but also with areas as diverse as creating game content automatically …

Georgios N. Yannakakis Julian Togelius Page 1 Artificial Intelligence and Games Georgios N.
Yannakakis Julian Togelius Page 2 Artificial Intelligence and Games Page 3 Georgios N …

1.1 Background Modern Artificial Intelligence (AI) research began in the mid-1950s [1].
Mainstream AI scientists focused on the narrow AI research which usually aims to solve a …

This paper provides a detailed investigation of using the Kullback-Leibler (KL) Divergence
as a way to compare and analyse game-levels, and hence to use the measure as the …

General Video Game Playing is a sub-field of Game Artificial Intelligence, where the goal is
to find algorithms capable of playing many different real-time games, some of them unknown …

The Fighting Game AI Competition (FTGAIC) provides a challenging benchmark for two-
player video game artificial intelligence. The challenge arises from the large action space …

In general, games pose interesting and complex problems for the implementation of
intelligent agents and are a popular domain in the study of artificial intelligence. In fact …

Methods for dynamic difficulty adjustment allow games to be tailored to particular players to
maximize their engagement. However, current methods often only modify a limited set of …

Game AI literature has looked at applying various enhancements to Rolling Horizon
Evolutionary methods or creating hybrids with popular tree search methods for an improved …