I’m currently looking at trying to find the longest shortest-path through a grid i.e. between two points in a grid, find the shortest path, then find the two points that would have the longest shortest path. Here’s my encoding of it (ignore the filled atoms, they’re for when I start constructing obstacles in my grid):