I will be short cause I am almost sure this code should already exist but I can't just find it using google.
So I need logic to make Computer count the shortest path from 1 tile to other including the diagonal movement and tile-based collisions.
If the layout is entirely grid-based, you can use the various mp_grid functions to calculate a path. They use the A* pathfinding algorithm so pretty fast.
If the layout is entirely grid-based, you can use the various mp_grid functions to calculate a path. They use the A* pathfinding algorithm so pretty fast.