Hi, I'm Alex. I currently study Computer Science with Artificial Intelligence at the University Of Nottingham.
Work In Artificial Intelligence
This project was done for University. The task was to create a CD management system where a user could add an artist to the database , add a CD to the database and add Tracks to the database where each table has a relation to another. The user is also able to Create,Update,Read and Delete from the database (CRUD).
Watch Showcase
This program was designed to be fed a string and compress it. It does this by sequencing the letters and putting their corresponding occurance in a list form. The user was also able to decompress strings by calling a decompress function.
View code
This project is a matching pairs game. The game will randomly generate X number of colors (determined by user) and hide them randomly on a X by Y board (defined by user). Once the user selects a tile they will need to match colors. This is a 2 player game which will, at the end of the game, declare a winner and then reset. Download code
This project is also a matching pairs game however written in assembly code. Here the code will generate a board , hiding letters under coordinates randomly on the board. The user selects which tile they would like to reveal by entering the coordinates of the tile they wish to display. They then have a second turn to select another tile. If the tiles match they win else they loose.
View code
The task here was to create an A* search algorithm in Matlab using a provided Greedy and UCS search. The user could select a start and end point , providing obstacles on a board of size defined by the user. The program would then calculate the most efficient way to the end goal using a heuristic.
This is the game Snake created in Java. You move the snake using arrow keys and you need to eat the green food that appears. You cannot crash into yourself or crash into a wall or you loose. When you die , if your score is great enough , a high score is set.
Download code
Download Jar file
This is a path finding algorithm I created. The user can draw a path of their choice and the program will calculate a route to the end goal. This algorithm uses a heuristic I created and will simply try to get as close to the end goal as possible.
Please note: More updates coming to this path finder.
How it works
Download Jar file
