Heuristic programming: A survey
Frank H. George · International Journal of Systems Science · 1972
This survey of heuristic programming starts by considering the nature of an algorithm as an automatic and precise process. A heuristic, by contrast, in an approximate and uncertain process, although algorithms and heuristics should be regarded as lying on a continuum. An examination of various applications of heuristics follows, showing the wide range of their use from game playing and logic theorem proving to shop floor scheduling and natural language programming.