This plugin provides implementations of shortest path algorithms that can be used directly with game characters on the map or on generic graph structures.
The image on the top of the topic is from the original paper of the Rectangle Expansion A* algorithm. I implemented it in WebAssembly for this plugin, with efficiency in mind. The algorithm generates even shorter paths than the traditional A* algorithm, since it allows for linear movement, and is generally faster too.
The plugin is also extensible via definition of custom path finding/following strategies following a common interface.
Please read the documentation an plugin instructions before asking any questions. Feel free to report bugs and request features via Github issues.
Usage
This plugin is mostly intended to be used as a Pathfinding core plugin, and does not do much by itself.
Regardless, the plugin has some commands to allow generating paths for the player to follow an event or go to a point on the map and for events to follow the player or a point on the map.