(3-a) Assume that a rook can move on a chessboard any number of squares in a...

 

Transcribed Image Text:

(3-a) Assume that a rook can move on a chessboard any number of squares in a straight line, vertically or horizontally, but cannot jump over other pieces. Propose an admissible heuristic here. (3-b) Consider the following state space and the heuristic function associated. The initial state is A and the goal state is F. 3 3 3. Heuristic Function: Show the result of A* algorithm on this search tree. (3-b) Write a consistent heuristic which is not admissible. Explain. h(A) = 0 h(B) = 1 h(C)=2 h(D)=1 h(E)=1 h(F) = 0 (3-a) Assume that a rook can move on a chessboard any number of squares in a straight line, vertically or horizontally, but cannot jump over other pieces. Propose an admissible heuristic here. (3-b) Consider the following state space and the heuristic function associated. The initial state is A and the goal state is F. 3 3 3. Heuristic Function: Show the result of A* algorithm on this search tree. (3-b) Write a consistent heuristic which is not admissible. Explain. h(A) = 0 h(B) = 1 h(C)=2 h(D)=1 h(E)=1 h(F) = 0