This is a relatively simple pathfinding project where I have tried to derive a shortest path algorithm. Main goal was to find all possible paths with weights assigned to them and store them in a very large array. However, I could not succeed to implement this because of failing to find a meaningful way of reverting to any arbitrary starting point in the recursion of the function, after reaching the end of the path for the first time. Thus, I have hard-coded a set of geometrical rules to find the closest node by filtering an array of adjacent nodes based on aforementioned rules.
Please note that, this work has been done completely without researching any literature about shortest path algorithms, intentionally. The goal was purely to improve my algorithmic thinking and force myself to get as close as possible to a legitimate solution.