School project · CS3243
AI Search & Game Agents
Implemented a suite of AI algorithms — from uninformed search to adversarial minimax — across a series of individual projects.
The problem
Translate theoretical AI concepts — search, constraint satisfaction, game-playing — into working implementations that solve non-trivial problem instances.
What I did
Sole implementer across all projects. Built DFS/BFS/UCS, A* with admissible heuristics, hill-climbing variants, CSP solvers with forward checking and AC-3, and a Minimax agent with alpha-beta pruning and custom evaluation functions.
Outcome
Each project met correctness and performance benchmarks. Tuning heuristics for the adversarial agent made the theory feel concrete in a way coursework alone cannot.