@MISC{Garibay_fall2008, author = {Ivan Garibay}, title = {Fall 2008}, year = {} }
Bookmark
OpenURL
Abstract
“Further research into intelligence of machinery will probably be very greatly concerned with searches... There is the genetical or evolutionary search by which a combination of genes is looked for, the criterion being the survival value. The remarkable success of this search confirms to some extent the idea that intellectual activity consist mainly of various kinds of search” –ALAN TURING, “Intelligent Machinery”, 1948 As early as the very beginnings of the science of computation, in the times of Charles Babbage and his “analytical engine”, search has been recognized as an important conceptual tool for problem solving. Later, in the initial stages of modern computational theory and artificial intelligence, Alan Turing proposed various kinds of search as a means to achieve machine intelligence. Since then, search, in particular heuristic search, has played an important and historical role in artificial intelligence. In heuristic search, a computer seeks the answer to a problem by searching through the space of all possible candidate solutions using heuristics to guide the search toward promising areas. These heuristics