Heuristic depth first search Flashcards
1
Q
What is heuristic depth first search?
A
Selects the neighbour with the lowest h(p) value.
CS255 - SEARCHES > Heuristic depth first search > Flashcards
What is heuristic depth first search?
Selects the neighbour with the lowest h(p) value.