Suppose you know the coordinates of two landmarks in Euclid. How can you determine the shortest driving distance (in blocks) between them?

Suppose you know the coordinates of two landmarks in Euclid How can you determine the shortest driving distance in blocks between them class=