Implementation of Search Methods

This lab assignment focuses on search methods in AI. Students are required to implement any one uninformed search method and any one informed (heuristic-based) search method in a programming language of their choice such as C or Java. The search methods are listed below in the two different categories.

Uninformed Search Methods

Depth First Search

Breadth First Search

Depth Limited Search

Uniform Cost Search (Branch and Bound)

Informed Search Methods

Greedy Search (Best First)

A* Search

Hill Climbing Search (Gradient Descent)

It is suggested that students follow the traveling salesperson example studied in class as the domain for the search problem. The program requirements are as follows.

Input: Start State, Intermediate States, Goal Test, Path Cost for both informed and uninformed methods, Search Heuristic for informed methods.

Processing: Any one uniformed and any one informed search method to go from the start state to the goal state.

Output: Path(s) traced from start state to goal state by the program, Total path cost calculated by the program, Search Tree drawn by the student.

It is not required to develop a GUI in the program to show the state map or the paths traced. It is sufficient to show the paths by listing the states from start to goal as a program output.

******USING UNIFORM COST AND HILL CLIMBING *********