A collection of small projects which explore various techniques of game AI. Please see each projects' respective README.txt file for more details. Summaries for each of the projects are as follows:

A simple implementatioin of the A* pathfinding algorithm, using a grid map (i.e. each node/cell has 4 neighbours).

A simple implementation of the connect-4 game. The user deploys white chips; the CPU, black. The decision-making algorithm utilized by the CPU is an alpha-beta pruned negamax.

A game where grey zombies chase the green player. The zombies move in a flock formation consisting of an invisible "leader" entity and zombie "followers".