
In my CS 180 (Artificial Intelligence class), I was tasked to implement search algorithms for pathfinding. This post series is a direct conversion of the jupyter notebooks for that project.
The jupyter notebooks can be found online here
In this machine problem, we are tasked with implementing search algorithms (BFS, DFS, A*) to find the shortest path (any path in the case of DFS) between two points on a plane that has polygonal obstacles.
In 2015, I worked on the Overpass’ Learning Platform for Google Summer Of Code 2015. This series details the creation of the project, from the initial project proposal, to the design, technical considerations, implementation, and user feedback.