Find closest path to the target on the hexagon map


I have problem with finding closest path from start point to the target, as you can see on the picture, blue hexagon represents start point, red hexagons represent blocade (you cannot go over these hexagons), green hexagon represents target and yellow hexagons represent closes path (what I have to find).

My current logic is that, every hexagon is Blueprint class which has 6 references (to each side) to neighbour hexagons (so I can “travel”), but I don’t know how to find a some good and simple algorithm for finding that path.

I really appreciate any help, thank you.

The common A* algorithm is both fairly simple and should perform well.

An example: Implementation of A*

Thanks, I thought that UE4 has something implemented for it :slight_smile: But anyway thanks :slight_smile: