UNINFORMED SEARCH

UNINFORMED SEARCH:
There are two uniformed search:-
1. Breath First Search
2. Depth First Search
SEARCH TREE:-
- Root Node
- Leaf Node
- Ancestor / Descendant
- Branching factor
- Complete Path / Partial Path.
EVALUATING SEARCH STRATEGIES:-
1. Completeness: is the strategy guaranteed to find a solution if one exists.
2. Optimality: if the solution is found, is the solution guaranteed to have the minimum cost.
3. Time Complexity: Time taken (number of node expanded worst or average case) to find a solution.
4. Space Complexity: Space used by the algorithm measured in term of the maximum size of list.

BREADTH SEARCH:-
Function breadth(){
queue = [];
state = root - node;
while(true) {
if is_goal(state)
           then return success
else add_to_back_of_queue(Sucessor(state));
if queue = []
           then repeat failure;
state = queue[0]
remove_first_item from(queue)
}
}

DEPTH SEARCH:-

Function depth(){

queue = [];

state = root - node;

while(true) {

if is_goal(state)

           then return success

else add_to_front_of_queue(Sucessor(state));

if queue = []

           then repeat failure;

state = queue[0]

remove_first_item from(queue)

}

}