SUBJECT : ARTIFICIAL INTELLIGENCE

2. Let's consider a variation of a maze game where the agent denoted by 'A,' must find a way to a goal tile. The following depicts the initial state of the maze, illustrating the position of the agent: Let the goal be as shown below: a) Define the problem as a search problem by specifying the "state," "Action", "goal test," and "path cost" for the given problem. (2 Marks) b) Invent two heuristics for this problem and explain how it is admissible. (3 Marks) c) Define a cost function and employ one of the proposed heuristics from the last section to implement the ( A^{*} ) algorithm for solving this problem. Provide a detailed walkthrough of the algorithm, with a specific focus on enumerating the nodes within the fringe set during the final step when the goal is reached. (3 Marks)

2. Let's consider a variation of a maze game where the agent denoted by 'A,' must find a way to a goal tile. The following depicts the initial state of the maze, illustrating the position of the agent: Let the goal be as shown below: a) Define the problem as a search problem by specifying the "state," "Action", "goal test," and "path cost" for the given problem. (2 Marks) b) Invent two heuristics for this problem and explain how it is admissible. (3 Marks) c) Define a cost function and employ one of the proposed heuristics from the last section to implement the A algorithm for solving this problem. Provide a detailed walkthrough of the algorithm, with a specific focus on enumerating the nodes within the fringe set during the final step when the goal is reached