Heuristic depth first search Flashcards

1
Q

What is heuristic depth first search?

A

Selects the neighbour with the lowest h(p) value.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly