Given two distinct positions, determine the direction (a unit vector)
in which one should move from the first in order to get closer
to the second. Ignores obstacles. Of several equally good directions
(in the chessboard metric) it picks one of those that visually
(in the euclidean metric) maximally align with the vector between
the two points.