Searching in a Maze, in Search of Knowledge: Issues in Early Artificial Intelligence

Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such as checker or chess, and formal problems, such as logic or geometry theorem-proving. These problems are well-defined, roughly speaking, at least in comparison to real-life problems, and as such have played the role of Drosophila in early AI. In this chapter I will investigate the origins of heuristic programming and the shift to more knowledge-based and real-life problem solving.

• Type: Conference
• Year: 2006
• Where: BIRTHDAY
• Authors: Roberto Cordeschi
• Keywords: Applied Computing, BIRTHDAY 2006, Favourite Case-studies, Heuristic Programming, Real-life Problem