Description

Artificial Intelligence (UCS-411)
Lab Assignment-3
1 If the initial and final states are as below, find the value of Heuristic function, by taking (i) Euclidean Distance
(ii) Manhattan Distance
(iii) Minkowski Distance
2 If the initial and final states are as below and H(n): number of misplaced tiles in the current state n as compared to the goal node need to be considered as the heuristic function. You need to use Best First Search algorithm.

3 If the initial and final states are as below and H(n): number of misplaced tiles in the current state n as compared to the goal node need to be considered as the heuristic function. You need to use Hill Climbing algorithm.

4 If the initial and final states are as below and H(n): Manhattan distance as the heuristic function. You need to use Best First Search algorithm.

5 Solve this given problem using Uniform Cost search. A is the initial state and G is the goal state