Hi, I'm trying to find the longest path on a map with grids with like 100 squares (no square can be visited twice). Right now I use a breadt-first tree and calculate the depth and reachable squares for each node, but how do I combine it to select the best possible node?
If I use depth + territory, the first nodes will win, territory*depth worked good in the beginning, but made some mistakes at the end.
Any ideas?