Project Overview
In Scotland Yard, one player (Mr. X) tries to evade capture by detective players on a map of London. This project is an AI opponent for the game, written in Java with an MVC structure as pair coursework at the University of Bristol between September and December 2024.
The AI searches a minimax game tree with alpha-beta pruning. Game states are scored by a heuristic evaluation function, which uses Dijkstra's algorithm to measure distances on the board.
Tools Used
Java
MVC
Minimax
Alpha-Beta Pruning
Dijkstra's Algorithm
Project Links
Source is not public: this was university coursework.