Mini Projects
This project consists of several smaller prototypes that were developed as part of my coursework for Games Production Practice module. They demonstrate a combination of material shown to us in lectures as well as some self-study, they are as follows:
Crowds
This prototype implements boid behaviours described by Craig Reynolds, those being separation; alignment; cohesion.
Search & Navigation
This prototype implements an A* pathfinding algorithm, that essentially finds the lowest F Cost (summation of G Cost – distance travelled from start node and H Cost – distance that still needs to be travelled to target node) which will be the shortest path.
Procedural Generation
This prototype implements a recursive backpacked algorithm, that essentially works with a “backpacker” that carves out a path until I no longer can proceed along that route, it then steps back along that route looking for any new paths to carve and continues this till it returns to the start position.
View Website