heuristic search plays key role in artificial intelligence in this you will learn in detail about it concept of heuristic search in ai heuristic is rule of thumb which leads us to the probable solution most problems in artificial intelligence are of exponential nature and have many possible solutions you do not know exactly which solutions are correct and checking all the solutions would be very expensive thusthe use of heuristic narrows down the search for solution and eliminates the wrong options the method of using heuristic to lead the search in search space is called heuristic search heuristic techniques are very useful because the search can be boosted when you use them difference between uninformed and informed search there are two types of control strategies or search techniquesuninformed and informed they are explained in detail as given hereuninformed search it is also called blind search or blind control strategy it is named so because there is information only about the problem definitionand no other extra information is available about the states this kind of search techniques would search the whole state space for getting the solution breadth first search (bfsand depth first search (dfsare the examples of uninformed search informed search it is also called heuristic search or heuristic control strategy it is named so because there is some extra information about the states this extra information is useful to compute the preference among the child nodes to explore and expand there would be heuristic function associated with each node best first search (bfs) *mean and analysis are the examples of informed search constraint satisfaction problems (cspsconstraint means restriction or limitation in aiconstraint satisfaction problems are the problems which must be solved under some constraints the focus must be on not to violate the constraint while solving such problems finallywhen we reach the final solutioncsp must obey the restriction