For my final project of my Programming and Data Structures class in the fall of 2020, I implemented a simple version of an algorithm used in robotics for mapping areas and finding paths between starting and ending locations. The RRT (Rapidly Exploring Random Trees) algorithm works by building out a tree of connections leading towards random points on the field. The algorithm fills up the space, avoids obstacles and finishes when the ending location is reached. The code then returns a path from beginning to end, though it is not necessarily the shortest possible path. For a more detailed explanation of the algorithm, my code and my process, check out my Github repository.