My domain is the following:
I have a nxn grid, each cell can be D=dirty, V=very dirty, C=clean, X=inaccesible and there are two special cells: S=start, F=finish
the agent starts in position S and needs to clean all the dirty cell and finish in position F.
I’m applying Astar algorithm to solve the problem, my current heuristic is: