> The fox is tasked with finding the shortest path that hits 100 points. This is exactly what I said (breadth-first). Breadth first find shortest distances to

> The fox is tasked with finding the shortest path that hits 100 points. This is exactly what I said (breadth-first). Breadth first find shortest distances to all nodes in the neighbourhood.