Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Consistent Heuristic - How do you show A heuristic is consistent?


A heuristic function is deemed consistent or monotone in the realm of artificial intelligence path-finding problems if its estimation is always equal to or less than the combined cost of reaching a neighboring vertex and the estimated distance from that vertex to the goal.