Pathfindax is a pathfinding framework that can be used to get a path to a destination in a network of nodes. Currently A*, potential fields and flowfield are implemented. These implementations support the following features:
- Support for up to 32 collision layers
- Support for multiple agent sizes
- Support for movement costs
- Built in support for the duality tilemap plugin
Its also possible to use dynamic pathfinding if you use potential fields. A example of this is shown in the video below:
You can find some examples on how to use pathfindax in duality here.
Most of the implementation is in a separate dll which can also be used without duality and only depends on the DualityPrimitives package. A example of using pathfindax in a console app can be found .
Branch | Status |
---|---|
master | |
develop |
Library | Version |
---|---|
Pathfindax | |
Duality.Plugins.Pathfindax.core | |
Duality.Plugins.Pathfindax.Tilemaps.core |