Map Pathfinder #87
mobbyg
started this conversation in
Treasure Map
Replies: 0 comments
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
https://github.com/MatejSloboda/Dijkstra_map_for_Godot
It's written in Rust from what the README says, so not sure how we would want to incorporate modules in other languages as that can add considerable time to get them to work in SE. But I thought something like this will be needed for AI of NPCs.
from the README
This is a GDNative project for Godot game engine, that introduces Dijktra Map pathfinding node. It provides a much needed versatility currently absent from the build-in AStar pathfinding. Its main feature is the ability to populate the entire graph with shortest paths towards a given origin point. Total lengths of shortest paths and directions can then be easily looked up for any point in the graph.
Common use cases include: pre-computing pathfinding for tower-defense games, RTS games and roguelikes; listing available moves for turn-based games; aiding in movement-related AI behaviour. You can find more examples in this amazing article.
The library is written in Rust programming language and performance should be comparable to C/C++ (approximately 10-20x faster than GDScript).
Note that the API is now stable! Some features may be added over time.
Beta Was this translation helpful? Give feedback.
All reactions