UNINFORMED SEARCH
BREADTH FIRST SEARCH
#Search start from root: then it search for all nodes at just immediate below node.And in similar fashion it goes till end node
#USE BACKTRACKING
#useful in finding shortest node between two node.
#queue implementation :FIFO(First In First Out)
DEPTH FIRST SEARCH
#It uses some greeedy alogrithm in selecting next level node and after selecting the node it search till depth of the node. Again if it could not find the node it start from the next node and search till end of that node untill it finds the result.
#It is optimal when goal is known.
#Stack implementation :LIFO(Last In First Out)
INFORMED SEARCH
BEST FIT SEARCH#Search by 1st selecting most promosing node and find solution as far as possible.
BRANCH AND BOUND SEARCH
#give feasible solution , it break the solution space and then bound them by using either Breadth first or Depth first search.
No comments:
Post a Comment