Back

Heuristic Search

Heuristic Search Techniques

Heuristic search is the process of finding the best close results for a search, particularly when there are no exact matches.

A heuristic is a technique designed to come up with the best possible solution that cannot be proved to be correct. The advantages of heuristic search is in performance over accuracy, i.e. quickly returned results rather than exact results. Thiese techniques although relatively simple interfaces for the underlying complex algorithmic process of search.

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z