Pathfinding algorithm

An algorithm that can find the most efficient path to a point for multiple players so the combined moves for all the players on the board is as low as possible.

This was an interesting challenge in how to solve a complex problem that needs a solution that can be applicable in a wide range of scenarios, so there is little that can be assumed or generalised by the code.




Download the compiled build from github and try it out yourself!
https://github.com/forsbergsskola-se/201-algorithms-and-datastructures-Jacob-Roming