of 2
Objective:
The primary objectives of this homework assignment are as follows:
1. Formulate search problems rigorously.
2. Analyse problems to perform Depth First Search (DFS), Breadth First Search (BFS), and Uniform-Cost
Search (UCS) algorithms.
3. Effectively handle and prevent issues related to redundant and repeated nodes during the search
process.
Task Description:
This assignment, worth 2.5 percent of your overall grade, you will delve into the world of problem-solving by
searching. Your task is to find a path from the starting state (node 5) to the goal state (node G) on an
undirected graph
Assignment Details:
1. You are required to apply three different search algorithms:
• Depth-First Search (DFS),
• Breadth First Search (BFS), and
• Uniform-Cost Search (UCS).
2. Each algorithm should clearly demonstrate the order of node expansion
3. You should also present the final path found by each algorithm
Hints on Conflict Resolution:
Consider the values on the arcs, which indicate the cost value of moving from one state to another. In the
event that two nodes have an equal chance for expansion, you are expected to resolve the conflict by
following alphabetical order. As part of this assignment, you will encounter issues related to redundant and
repeated nodes during the search process. Your task is to address these nodes effectively to avoid looping and
ensure accurate results.
