An implementation of the A-Star pathfinding algorithm tailored for traversing a bespoke collection of weighted hexagons. It's intended to calculate the most optimal path to a target hexagon where you are traversing from the centre of one hexagon to the next along a line orthogonal to a hexagon edge
☆22Jan 31, 2023Updated 3 years ago
Alternatives and similar repositories for hexagonal_pathfinding_astar
Users that are interested in hexagonal_pathfinding_astar are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Bevy plugin for Flowfield based pathfinding☆68Nov 8, 2025Updated 9 months ago
- Pathfinding on grids using jump point search and connected components.☆28Updated this week
- A collection of nature-inspired metaheuristic algorithms.☆16May 2, 2024Updated 2 years ago
- A simple helper for spawning objects in Bevy.