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.
On the other hand, how do I explain that the graph-based version of the greedy best-first search is complete?
