Question

(a) Ame that at ench time step, the agent can move one unit either up, down, left or right, to the centre of an adjacent grid square: Oue admisible heuristic for this problem is the Straight-Line-Distance heuristic However, this is not the best heuristic Give the name of another adiesible beuristic which dominates the Straight- Line-Distance beuristic, and write the formula for it in the format b) Now assme that at each time step, the agent can take one step either up, down, left, right or diagonally. When it moves dingonally, it travels to the centre af n diagonally neighboring grid square, but diagonal step is still considered to have the same t ie e "move") as a horizontal or vertical step (like a King move in Ch. )Aming that the cost of a path is the total number of (horizontal vertical or dingonal) moves to reach the goal, is the Straight-Line- Distance beuristic still admissible? Explain why. ii) Is your heuristic from part (a) still admisesible? Explain why. i Try to devise the best admissible beuristic you can for this problem, and write a formula for it in the format:

Answer 1

As C Maotanoe fc rove Svrtable oin ght ne becase the einaion lanhatfan deance defned by