Search Results for author: Ivan Bravi

Found 7 papers, 5 papers with code

Rinascimento: searching the behaviour space of Splendor

no code implementations15 Jun 2021 Ivan Bravi, Simon Lucas

One of the main purposes of play-testing a game is gathering data on the gameplay, highlighting good and bad features of the design of the game, providing useful insight to the game designers for improving the design.

Rinascimento: using event-value functions for playing Splendor

1 code implementation10 Jun 2020 Ivan Bravi, Simon Lucas

These events are processed by an Event-value Function (EF) that assigns a value to a single action or a sequence.

Learning Local Forward Models on Unforgiving Games

1 code implementation1 Sep 2019 Alexander Dockhorn, Simon M. Lucas, Vanessa Volz, Ivan Bravi, Raluca D. Gaina, Diego Perez-Liebana

This paper examines learning approaches for forward models based on local cell transition functions.

Rinascimento: Optimising Statistical Forward Planning Agents for Playing Splendor

1 code implementation3 Apr 2019 Ivan Bravi, Simon Lucas, Diego Perez-Liebana, Jialin Liu

Game-based benchmarks have been playing an essential role in the development of Artificial Intelligence (AI) techniques.

Efficient Evolutionary Methods for Game Agent Optimisation: Model-Based is Best

1 code implementation3 Jan 2019 Simon M. Lucas, Jialin Liu, Ivan Bravi, Raluca D. Gaina, John Woodward, Vanessa Volz, Diego Perez-Liebana

This paper introduces a simple and fast variant of Planet Wars as a test-bed for statistical planning based Game AI agents, and for noisy hyper-parameter optimisation.

SMAC+

Shallow decision-making analysis in General Video Game Playing

1 code implementation4 Jun 2018 Ivan Bravi, Jialin Liu, Diego Perez-Liebana, Simon Lucas

The General Video Game AI competitions have been the testing ground for several techniques for game playing, such as evolutionary computation techniques, tree search algorithms, hyper heuristic based or knowledge based algorithms.

Decision Making Descriptive

Cannot find the paper you are looking for? You can Submit a new open access paper.