Question

Describe a strategy and design an algorithm for finding optimal solutions to such search problems. You may use any example based on search algorithms we have studied in the class, or any combination or modified version of any heuristic based search algorithm. Please include a description of what your search space might look like, what the states might be, and what may be heuristics that could be selected.

Search and Heuristics

Answer 1

Q. Describe a strategy and design an algorithm for finding optimal solutions to such search problems. You may use any example based on search algorithms we have studied in the class, or any combination or modified version of any heuristic based search algorithm. Please include a description of what your search space might look like, what the states might be, and what may be heuristics that could be selected.

Ans - Heuristic search is an AI search technique that uses heuristic for its moves. Heuristic is a rule of thumb that probably leads to a solution. Heuristics play a major role in search strategies because of exponential nature of the most problems. Heuristics help to reduce the number of alternatives from an exponential number to a polynomial number. The term heuristic is used for any advice that is often effective, but is not guaranteed to work in every case. Within the heuristic search architecture, however, the term heuristic usually refers to the special case of a heuristic evaluation function.

One of the heuristic based search algorithm is Pure Heuristic search.

Disadvantage - It ignores the cost of the path of far node n, so it may or may not find optimal solutions.

Hope it helps. If you like the solution then don't forget to give a thumbs up and if you have any queries feel free to use the comment section.