Compare following informed searching algorithms based on performance measure with justification: Complete, Optimal, Time Complexity and Space Complexity.

9.2kviews

written 8.2 years ago by

teamques10 ★ 68k

modified 2.5 years ago by

binitamayekar ★ 6.6k

(i) Greedy Best First.

(ii) A*

(iii) Recursive Best-First (RBFS)

artificial intelligence

ADD COMMENT EDIT

1 Answer

453views

written 8.2 years ago by

teamques10 ★ 68k

• modified 8.2 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

ADD COMMENT EDIT

Please log in to add an answer.