Ask
Login
0
9.7kviews
Compare following informed searching algorithms based on performance measure with justification: Complete, Optimal, Time Complexity and Space Complexity.
written 9.3 years ago by gravatar for teamques10 teamques10 ★ 70k modified 3.6 years ago by gravatar for binitamayekar binitamayekar ★ 6.7k

(i) Greedy Best First.

(ii) A*

(iii) Recursive Best-First (RBFS)
artificial intelligence
ADD COMMENT EDIT
1 Answer
3
466views
written 9.3 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 9.3 years ago

Greedy Best First:

Greedy best-first search expands the nodes that appears to be closest to the goal.

enter image description here

A*:

A* Algorithm avoid expanding paths that are already expansive.

enter image description here

Recursive Best-First (RBFS):

RBFS keeps the track of Evaluation Value of the best alternative path available.

enter image description here

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.