A simple implementation of breadth-first search (BFS) to find the shortest path between two positions on a grid. This algorithm can be used in various applications, such as pathfinding in games or routing in networks. try it! https://ra-wo.github.io/Shortest-Path-Finder/
