Path Finding in the Works!

Another developer friend of mine, who I will refer to as Chakra, has been developing a path finding algorithm for usage in Fragile. He has been doing it in a simpler language, in order to develop the actual theory and logistics of the algorithm first, but he is making good progress and this may very well end up being used in the game!

Currently, the code reduces a polygon field to a graph and then traverses that graph in order to quickly calculate a unit's path, and it functions properly regardless of the size or shape of the unit and the obstacles that it is maneuvering around. It seems this will be very speed and memory efficient and may even be able to handle a much higher number of units than we needed, but further attempts may nonetheless be made to improve its speed and capabilities.

Here is a picture of the graph that his code generated in order for him to inspect its output. Twenty fifth step complete:

I told him the yellow looks ugly, but he seems to like it. :)