Artificial Intelligence: Search Methods in PROLOG

In the specialized field of Artificial Intelligence in computer science, search methods are being researched so as to find a path and/or a shortest path from a specific start node to another specified destination node within a graph/tree/network. There are a number of algorithms available for this purpose. Broadly these methods are divided into two classes: Uninformed Search and Informed search Methods. Uninformed search method includes Breadth First Search (BFS) method and Depth First Search method (DFS). Informed search method includes Hill Climbing search method, Steepest Hill Climbing search method, Best First Search method, and A* search method. PROLOG (PROgramming in LOGic) has emerged as an easy to learn tool for coding these algorithms.