Sign inSign in
ConceptSystems & CS

Consistent heuristic

A heuristic is consistent if for every node and its successor, the heuristic value of the node is less than or equal to the heuristic value of the successor plus the step cost.
as Brian Yu defines itHarvard University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.