Monotone (consistent) heuristics A heuristic is monotone if the f-value is non-decreasing along any path from start to goal.
{"Image DocumentName": "Monotone (consistent) heuristics", "Image ImageDescription": "A heuristic is monotone if the f-value is non-decreasing along any path from start to goal. This is fulfilled if for every pair of nodes. n \uf0e0 n\u2019 f(n) <= f(n\u2019) = g(n\u2019) + h(n\u2019) = g(n) + cost(n,n\u2019) + h(n\u2019) f(n) = g(n) + h(n) Which gives the triangle inequality. h(n) <= cost(n.n\u2019) + h(n\u2019) cost(n,n\u2019) h(n\u2019) goal. h(n)", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}