I have an infinite square and I have some automa identifies by a string (0101011001.....) and one position (x,y). On the square there are some obstacles identifies from one position (x,y, x0, y0). They are rectangles. If the automa wants to catch up the B automat being made the minimal distance and without to meet with the obstacles as I can calculate the minimal distance? Backtracking?
this is the problem
if x send the signal 11 the automa that have to move to x are 11, 110, 111 but only 11 can reahc x cause respect the minimum distance.
the minimum distance between is 8 but 110 have to move up to avoid the rectangle....
Why don't you just google pathfinding algorithms?
Yes A* is right!
But i don't find the code......do u know a site wheer i can find it?
search on www.gamedev.net or www.google.com
you are sure to find something..