About The Job
Hello, I’m a developer working on a small 3D passion project. In this game I have a uniform, dynamic grid of cells. I’m in need of an extremely fast pathfinding algorithm that can find the shortest path between two cells.
I’ve already implemented a rather small a* pathfinder using a priority heap for open set insertion, but it’s just not quite fast enough. This will be called quite frequently.
I’m looking for someone to take my existing code and expand upon it with Jump Point Search for optimization. The code I have is small and easy to read and work with. I’ve tried looking into JPS myself, but I wasn’t quite able to grasp the concept as I generally lack competence in that area, and I’m running short on time.
This shows the massive speed up that can be made by properly implementing JPS into a*
A*:
https://www.youtube.com/watch?v=yAwPfvK6_6E&t=9m33s
A* + JPS:
https://www.youtube.com/watch?v=yAwPfvK6_6E&t=10m2s
This is what I’m wanting.
We’d also be in contact (preferred method of contact would be discord) , and you’d join the team create until the job is done.
Payment
For the job of implementing 3D Jump Point Search into a pathfinding algorithm, I’m offering $200 USD via paypal or 57k robux. If you feel this is an unfair price, negotiation can be made
Contact
You can contact me here on the developer forum or via my discord @ tyridge77#5390.
Thanks!