1
$\begingroup$

I understand that a tree-based variant will have nodes repeatedly added to the frontier. How do I craft an example where a particular goal node is never found. Is this example valid.

enter image description here

On the other hand, how do I explain that the graph-based version of the greedy best-first search is complete?

$\endgroup$
1
  • $\begingroup$ Hi and welcome to AI SE! Do you know the difference between tree search and graph search? If not, please, read this answer. $\endgroup$
    – nbro
    May 21, 2020 at 14:34

0

You must log in to answer this question.

Browse other questions tagged .