0
Good afternoon, everyone,
I have a doubt regarding admissible heuristics, I know that for it to be admissible it is necessary that every value of h(n)<=H(n)* but I am still in doubt of how I should calculate this for example, in the image below there is a heuristic for the graph, the shortest path if given by A-C-E-D-G costing 43.
As I calculate to know if the heuristic is admissible I am very lost, I must sum all G values making the smallest path and then add with all the heuristics of the nodes that I passed?
