[TUTO] The shortest path from A to B

Hello guys,

I am started a new project with some friend and my first challenge was to use blueprints to find the shortest path from A to B.
It can be complicated when you don’t have a lot of skills in programming (like me ;-)).

I’d like to share my work with you because sadly there is no clear things about that on Unreal Engine forum (the things I’ve found are way too complicated with no real explanations).

Here is the result of this prototype :
[video]https://youtu.be/B7XxljlTlac[/video]

Here you can find the project that you can study and modify as you wish : Dropbox - File Deleted

And finally here you can find a PDF document explaining everything about the project and how things work (yeah a tutorial :-p) : Dropbox - File Deleted

I hope this will help a lot of people here.
I hope everything will be clear enough, if you have any questions or if you think this can be improved in any way just comment about it ,-), I’ll follow the thread.

Thanks,
Alex

Thats awesome! Thanks for the tutorial, very nicely put together and covers things very well. Very often a simple A* can do the trick for things rather than trying to use navmesh so im sure plenty of people will find this very helpful.

I’m pretty sure that navmesh uses A*. A navigation mesh is a graph, all graph algorithms (like A*) work with it. But yeah, if you need a grid or something else than a free form mesh graph, then it’s nice to be able to do things like this.

Yep it most likely still uses A* for it’s navigation algo, I haven’t actually looked at it too closely but it’s a much heavier version than a pure grid based system like this 1 which is very simple and lightweight