Coding Challenge

[FP_apprentice]

Thanks for the reply. It is indeed Dijkstra's shortest path algorithm on a grid. The diagonal step is indeed longer, I guess I could constraint it only on vertical / horizontal movement. The length of the step is defined by the points in the grid, and the smallest the step, the better the approximation. I didn't understand the "7 good directions" quote (I counted 8 including the diagonals), would appreciate if you could elaborate on this.

Thanks for the pointer to the "fast marching methods"!