SEARCH ALGORITHMS FOR ARTIFICIAL INTELLIGENCE

Search in Artificial Intelligence (AI) is a well known area of research with many real applications, such as expert systems, finding the shortest path to a location, two-person board games such as chess, Othello, checkers and related problems.  We describe the basic blind search techniques, such as the Depth-First Search (DFS), the Breadth-First Search (BFS) and the Depth-First Search with Iterative Deepening (DFSID) by Korf (1990).  We discussed the advantages and drawbacks of each approach.  Later we discuss and summarize diverse heuristic search algorithms and describe how these algorithms can overcome the drawbacks of blind search algorithms.  Some classes of heuristic search algorithms have been studied well.  However, the bidirectional heuristic search (BHPA) has mainly been a topic of limited research and application since it was introduced by Pohl (1971).  Different bidirectional search methods developed by Kaindl & Kainz (1997) are presented in the last section (5).  We conclude our discussion with AI programming languages used for heuristic search schemes.