Scribd
Upload
3 views2 pages

Homework Assignment 2

The homework assignment focuses on navigating a road map graph from a starting node (S) to a goal node (G) using various search algorithms. Students are required to implement the A* search algorithm, Greedy Best First search, Breadth-first search, and Depth-first search to determine the optimal path. The assignment is worth a total of 8 marks.

Uploaded by

user-683446
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Homework Assignment 2

The homework assignment focuses on navigating a road map graph from a starting node (S) to a goal node (G) using various search algorithms. Students are required to implement the A* search algorithm, Greedy Best First search, Breadth-first search, and Depth-first search to determine the optimal path. The assignment is worth a total of 8 marks.

Uploaded by

user-683446
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Homework Assignment:

Fundamentals of Artificial Intelligence


(8Marks )

_______________________________________________________________

Problem Description:
You are given a road map graph where the objective is to navigate
from the starting node (S) to the goal node (G). Each link in the
graph represents the distance between two nodes, and each node
contains a number indicating the straight-line (heuristic) distance
from that node to the goal (G).

Solve the above problem by :


• Use the A* search algorithm to find the optimal path from
node S to G.
• Use the Greedy Best First search algorithm to find the optimal
path from node S to G.
• Use Breadth-first search and depth-first search to find the optimal
path from node S to G.

You might also like