Discrete Models and Algorithms to create a more satisfying and strategic opponents
For many 4x and Grand Strategy computer games (e.g. Civilisation, Europa Universalis), the player will be playing against one or more AI opponents. For many games, the AI is not clever enough to stand up to a player without being given the ability to "cheat" - ability to spawn in resources, see what the player is doing, etc. This creates an unsatisfactory opponent for a player, as it gives them opponents that fight through "cheating" over strategy or out-manoeuvring the player.
The aim for my PhD is to look into the potential uses of SAT and similar to create a more satisfying and strategic opponent for players to play against in these styles of computer games. To this end, I’ll be identifying potential for improvement regarding my proposal, and once I’ve narrowed down the specifics - be it related to improving how SAT solvers can handle problems, or how better to encode AI into SAT - I will be working on ways to improve AI for turn based strategic games.
Lizzie Vialls is a recent Computer Science graduate of University of Leicester, having graduated with a 2:1 and a prize for best third year project, which was the project that fueled her interest in SAT. When not searching for an errant semicolon in her code she can be found working with various online gaming communities, hunched over many a tabletop game, or attempting to make friends with the local feline populace.