Best First Search :- Best First Search was described by Judea Pearl. It is the part of heuristic search.
Algorithm :-
Algorithm :-
- Step 1 :- Put the initial node on the list BEGIN.
- Step 2 :- If (BEGIN is empty) or (BEGIN is GOAL) terminate search.
- Step 3 :- Remove the first node from BEGIN call this node as A.
- Step 4 :- If (A is GOAL) terminate search.
- Step 5 :- Else if node A has successor generate all of them. Find out how far they are from the goal node. Sort all the children generated so, far by the remaining distance from the goal.
- Step 6 :- Name the list as BEGIN 1
- Step 7 :- Replace BEGIN with BEGIN 1
- Step 8:- GOTO Step 2
No comments:
Post a Comment