34 citations · 94 across the 29 of their papers we have counts for
4 papers · 1 filter
Ms. Pac-Man Versus Ghost Team CIG 2016 Competition
Piers R. Williams, Diego Perez-Liebana, Simon M. Lucas
This paper introduces the revival of the popular Ms. Pac-Man Versus Ghost Team competition. We present an updated game engine with Partial Observability constraints, a new Multi-Ag…
Rolling Horizon Coevolutionary Planning for Two-Player Video Games
Jialin Liu, Diego Pérez-Liébana, Simon M. Lucas
This paper describes a new algorithm for decision making in two-player real-time video games. As with Monte Carlo Tree Search, the algorithm can be used without heuristics and has…
Optimal resampling for the noisy OneMax problem
Jialin Liu, Michael Fairbank, Diego Pérez-Liébana +1
The OneMax problem is a standard benchmark optimisation problem for a binary search space. Recent work on applying a Bandit-Based Random Mutation Hill-Climbing algorithm to the noi…
Bandit-Based Random Mutation Hill-Climbing
Jialin Liu, Diego Peŕez-Liebana, Simon M. Lucas
The Random Mutation Hill-Climbing algorithm is a direct search technique mostly used in discrete domains. It repeats the process of randomly selecting a neighbour of a best-so-far…