Skip to content
ml-recall

#consistent-heuristic

2 questions from Search & Planning

Timed test

2 questions · 2 min · score and explanations at the end

Take a test
Q 1 / 2Score 0 / 0

Question 1: Select all that apply

hardAI-checkedSearch & Planning

A heuristic is consistent (monotone) if h(m)≤c(m,n)+h(n)h(m) \le c(m, n) + h(n) for every edge m→nm \to n, and h=0h = 0 at goal nodes. What follows when A* uses a consistent heuristic? Select all that apply.

Select all options that apply