The Infected Horde

  • 2D Unity game developed at the Birmingham City University site of the 2018 Global Game Jam event in a team of 5, given the theme of ‘Transmission’.
  • Top-down 2D game where the objective is to control a carrier of a sentient disease and escape a hospital by transmitting the disease to as many patients as possible while avoiding guards, doctors and quarantine measures.

Override

  • Unity3D game developed during a 48-hour game jam at university in a team of 4 with a theme of ‘Override’.
  • 3D grid-based puzzle game requiring the player to traverse levels by controlling various different robots with different movement patterns and capabilities.

About Me

Recent Mathematics and Combuter Science graduate from the University of Birmingham, looking to enter the field of Software Development

 

Projects:

Visual.Search

  • Java application designed as a learning aid for basic graph search algorithms, specifically A* search, Dijkstra’s algorithm, Depth First, Breadth First and Greedy Best-First algorithms.
  • Developed as part of a team of 6 for university ‘Team Project’ module assignment of creating a program for visualising an algorithm.
  • Implemented a system for the generation of randomised Node Graphs for visualisation and traversal by both the user and the program.

Override

  • Unity3D game developed during a 48-hour game jam at university in a team of 4 with a theme of ‘Override’.
  • 3D grid-based puzzle game requiring the player to traverse levels by controlling various different robots with different movement patterns and capabilities.

The Infected Horde

  • 2D Unity game developed at the Birmingham City University site of the 2018 Global Game Jam event in a team of 5, given the theme of ‘Transmission’.
  • Top-down 2D game where the objective is to control a carrier of a sentient disease and escape a hospital by transmitting the disease to as many patients as possible while avoiding guards, doctors and quarantine measures.

Visual.Search

  • Java application designed as a learning aid for basic graph search algorithms, specifically A* search, Dijkstra’s algorithm, Depth First, Breadth First and Greedy Best-First algorithms.
  • Developed as part of a team of 6 for university ‘Team Project’ module assignment of creating a program for visualising an algorithm.
  • Implemented a system for the generation of randomised Node Graphs for visualisation and traversal by both the user and the program