e/Consistent heuristic

Information
has gloss	eng: In computer science, a consistent (or monotone) heuristic function is a strategy for search that approaches the solution in an incremental way without taking any step back. Formally, for every node n and every successor p of n generated by any action a, the estimated cost of reaching the goal from n is no greater than the step cost of getting to p plus the estimated cost of reaching the goal from p. In other words: : h(N) \leq c(N,P) + h(P) and : h(G) = 0.\, where :* h is the consistent heuristic function :* N is any node in the graph :* P is any child of N :* G is any goal node.
lexicalization	eng: consistent heuristic
instance of	(noun) a commonsense rule (or set of rules) intended to increase the probability of solving some problem heuristic program, heuristic rule, heuristic