Rapidly Exploring Random Trees
A Coding Demonstration
This coding demo was my final project for an undergraduate course in Data Structures. We were challenged to choose a little-known or largely forgotten data structure and design and implement a working version from scratch. I chose the Rapidly Exploring Random Tree, a data structure that takes a playing field and an arrangement of obstacles and uses trial and error exploration to discover a path from a starting point to a destination.
The result is both artistically pleasing and surprisingly effective, as the tree gradually explores its surroundings before ultimately finding its way to the finish. This project is a fun little demonstration of my coding skills and my love of converting interesting, quirky ideas into working software.
