Heuristic (from the Greek “heuriskein” meaning “to discover, to learn, to find out”) search is a science of different methods respectively a rule of thumb in order to find out the ever best possible solution to a certain problem (there is certainly more than one solution to each problem). In computer science this method plays a major role because of exponential nature of most problems. Heuristics methods help to reduce a number of alternatives by using special search strategies..
This process, mostly used in artificial intelligence (AI), enables to choose the best and most appropriate answer of several solutions that have been discovered during investigations. For this it is necessary to evaluate the answers and to make use of so-called “trial-and-error” methods. The key is to look at a problem from different angles, to use different approaches and to bring in additional knowledge, in order to make the search more effective. Only in this way, it is possible to find an adequate solution to a problem.
This investigation can be effective, nonetheless its success is not guaranteed.
- http://www.oxforddictionaries.com/definition/english/heuristic (Page consulted: 05.03.2016; Last updated: s.d.).
- http://intelligence.worldofcomputing.net/ai-search/heuristic-search.html#.Vtsm-Uu2TGB (Page consulted: 05.03.2016; Last updated: s.d.).
- https://www.cs.utexas.edu/~mooney/cs343/slide-handouts/heuristic-search.4.pdf(Page consulted: 05.03.2016); Last updated: s.d.).
- Bonet, Blai / Hansen, Eric, Heuristic Search for Planning under Uncertainty, URL: https://www.ics.uci.edu/~dechter/papers/paginated_binders/PART%25201.pdf (Page consulted: 05.03.2016; Last updated: s.d.).