Hi, just an exercise
A level that demonstrate how implement Dijkstra shortest path on en hexagonal grid in blueprints.
Anyway, doing this again, I will use C++ for sure.
Even for a relatively short algorithm like this the blueprint graph becomes quite large.
1 Like
Beautyful! Thats really something see 20000 exagon all togheter XD
Thanks for share