The Heuristic Search Assumption
Symbolic data is searched using various methods of estimation or "heuristics", which make the search more efficient.


Heuristic Search Hypothesis
: The solutions to problems are represented as symbol structures. A physical symbols system exercises its intelligence in problem solving by search—that is, by generating and progressively modifying symbol structures until it produces a solution structure.

Newell & Simon (1976, p.120)

Heuristic Search: A search that uses special knowledge about a problem domain to find solutions more efficiently. For example, a search of possible moves in a chess game could be aided by a set of heuristics that tell the computer to avoid useless lines of attack, to maintain center control, and so forth.
Immediately related elementsHow this works
-
Artificial Intelligence »Artificial Intelligence
Can computers think? [1] »Can computers think? [1]
Yes: physical symbol systems can think [3] »Yes: physical symbol systems can think [3]
The Heuristic Search Assumption
Computers play expert chess using heuristic search »Computers play expert chess using heuristic search
Combinatorial Explosion of Search »Combinatorial Explosion of Search
Trail and Error different from essential discrimination »Trail and Error different from essential discrimination
Herbert Simon »Herbert Simon
+Commentaires (0)
+Citations (0)
+About