Looking for Java Developer who has experience with pathfinding algorithms
Budget: $250 – $750 AUD
I am looking for a Java developer who has experience with pathfinding algorithms, specifically Djikstra's and A* algorithms.
I am currently developing a pathfinding algorithm for a game. There is currently a working implementation, however due to a large number of teleports, I believe my heuristic isn't well suited to the problem, and occasionally takes quite a while to generate a solution (although it is always successful).
Because of it's poor performance, I'm looking for a developer who can optimise my program via a mix of a better heuristic function, pre-processing techniques and clustering.
There link below provides a visualisation on what the map of the game looks like:
explv.github.io
I am currently developing a pathfinding algorithm for a game. There is currently a working implementation, however due to a large number of teleports, I believe my heuristic isn't well suited to the problem, and occasionally takes quite a while to generate a solution (although it is always successful).
Because of it's poor performance, I'm looking for a developer who can optimise my program via a mix of a better heuristic function, pre-processing techniques and clustering.
There link below provides a visualisation on what the map of the game looks like:
explv.github.io