wiki:BigIdeas/HeuristicSearch

Heuristic Search

Search

a well-defined, formalized process (an algorithm) which eventually converges to a local (or global) optimum.

Backtracking

Back-tracking is a fundamental notion of returning back to the last fork from a dead-end or when a limit for depth is exceeded. It is how to recover from failures and to avoid of getting lost.

Domain-Specific Heuristics

An informed search process which is guided by a heuristic - a procedure that generates highly informed guesses.

Converges much faster than a brute-force enumerating, or a "blind" exploration processes.

Pruning of a search space =

Pruning is removing of branches which, according to some heuristic learned by a prior experience, is known to be empty or sub-optimal or leading to a dead-end.

Pruning is also heuristic-based.

Last modified 2 years ago Last modified on Dec 27, 2017, 5:18:25 PM
Note: See TracWiki for help on using the wiki.