Is there a better tracking code?

You should try to search A* on Google. That's a good algorithm to get the path between 2 point. I don't know what kind of game are you doing but it work for both rts and platform games.

Thanks, but it's too complicated for BASIC.

Instead of 190 to 194,we can write below: DRGX=DRGX+((DRGX<MANX)-(DRGX>MANX))*DPSD DRGY=DRGY+((DRGY<MANY)-(DRGY>MANY))*DPSD

Minimax, maybe? depending on you search tree it might be quite resource-intensive but it works good with low-branching, big-depth trees. You might also use αβ-pruning to improve the seach.