How can I find the shortest amount of jumps between two points on a map?

[Chatouille]

There’s no super-simple solution to this problem. You need a pathfinding algorithm.

The most straightforward solution is probably the A* algorithm :

A* search algorithm

You can either implement it yourself, or use the general-purpose implementation provided by the Engine (in GraphAStar.h). The builtin solution is very generic and requires some setup to adapt to your own classes. See below how it can be used :

How do i implement FSearchNode from FGraphAStar?

This just boggles my mind. Normally i can interpret unreal code well. Or remake it myself. But here im completely lost. Im trying to build a pure 2d game, that is tile based. Since its 2d and tile based, i dont need the expensive navigation mesh, and may not need collisions. I only need an A Star algorithm that can calculate the best tile path to go through to reach a destination. So i was told to check FGraphAStar, that supposedly has everything. Though i cant even understand how to call…