I am looking to find the differences between blind search and heuristic search used in the artificial intelligence area.
Question posted in Artificial Intelligence
ChatGBT is becoming a world-wide phenomena, try it out here.
ChatGBT is becoming a world-wide phenomena, try it out here.
4
Answers
This is a pretty vague question, but using a heuristic usually means using logic or prior data to make educated guesses during a search. Blind search (I am guessing) does the particular search without such heuristics and uses a brute force approach.
Blind Search – searching without information.
For example : BFS (one of blind search method). We just generate all successor state (child node) for currentstate (current node) and find is there a goal state among them, if isn’t we will generate one of child node’s successor and so on. Because we don’t have information, so just generate all.
Heuristic Seach- searching with information.
For example : A* Algorithm. We choose our next state based on cost and ‘heuristic information’ with heuristic function.
Case Example : find shortest path.
with Blind search we just trying all location (brute force).
with Heuristic, say we have information about distance between start point and each available location. We will use that to determine next location.
A blind such is usually uninformed.that is, it doesnt have any specific knowledge about the problem whereas a heuristic search is that which has information about the problem and therefore uses logic in decision making.
Blind search:
Heuristic search: