how can a heuristic be admissable (never give an overestimate) but NOT consistent?
definition of consistency:
h(n) is consistent if, for every node n and every successor n' of n generated by any action a, the estimated cost of reachin ghte goal from n is no greater than the step cost of getting to n' plus the estimated cost of reaching the goal from n'
this isn't a hw question, just fyi
definition of consistency:
h(n) is consistent if, for every node n and every successor n' of n generated by any action a, the estimated cost of reachin ghte goal from n is no greater than the step cost of getting to n' plus the estimated cost of reaching the goal from n'
this isn't a hw question, just fyi
