Path Finding Visualisation

This interactive A* pathfinding visualisation showcases a hands-on implementation of the A* search algorithm, brought to life through real-time graphics. I developed it using C++ and Raylib, a lightweight graphics library known for its simplicity and speed — perfect for experimenting with game-like interfaces and algorithm visualisation.

The project is compiled to WebAssembly using Emscripten, making it playable in the browser without any extra steps (mobile wip). Visitors can set start/end points (with middle clicks), add and remove barriers (with left and right click), and watch the algorithm compute the shortest path in real time.

What makes this project special is that it brings together several advanced concepts: graph traversal algorithms, grid-based simulation, dynamic UI interaction, and low-level compilation for the web. It was also a personal milestone — I taught myself the full pipeline from writing C++ code to deploying it in the browser using WebAssembly.

This is just the beginning. I plan to build more visualisations and tools using Raylib — and eventually move toward OpenGL, NVIDIA PhysX, and more advanced game engine development. My goal is to more deeply explore game dev, simulation, interactivity, and algorithms.