So the idea is kinda simple.
I am using AILerp to move squares around. The “1” square goes into another “1” to create a “2” and so on. I have no problems when there is a reachable square. The problem appears when there is no path between squares, like I showed in the picture above.
The selected square is at x:-2.2 y:1.1 and the “destination” one is at x:1.1 y:-2.2.
I tried to use this link: https://arongranberg.com/astar/docs/pathutilities.html#IsPathPossible, but my problem is that I dont understand how to tell it specifically which is node1 and which is node2. Does it have something to do with GetNearest?