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).
RELATED ARTICLESExplain
Artificial Intelligence
Can computers think? [1]
Yes: physical symbol systems can think [3]
The Heuristic Search Assumption
Trail and Error different from essential discrimination
Best heuristics aren't just trial and error
Zenon Pylyshyn
Graph of this discussion
Enter the title of your article


Enter a short (max 500 characters) summation of your article
Enter the main body of your article
Lock
+Comments (0)
+Citations (0)
+About
Enter comment

Select article text to quote
welcome text

First name   Last name 

Email

Skip