Best heuristics aren't just trial and error
Heuristic searches don't necessarily rely on trial and error. Programs can be structured so that a heuristic method moves the search ever closer to a problem solution without the need for redundant backtracking.
Zenon Pylyshyn (1974).
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 Â»The Heuristic Search Assumption
▲
Trail and Error different from essential discrimination Â»Trail and Error different from essential discrimination
■
Best heuristics aren't just trial and error
◄
Zenon Pylyshyn Â»Zenon Pylyshyn
+Kommentare (0)
+Verweise (0)
+About