def pathKey(node):
    """
    Give sort key that prioritizes node with longer path, where min key is higher priority. 
    
    This is useful for tie breaking; we guess that all else being equal, the path that has traveled
    farther is more likely to be closer to the goal.
    """
    
    return -len(node.path);