Consider the maze problem below in which the white boxes are available paths and gray boxes are blocked (no movement allowed). S is the start point and G is the goal. There are four moves from a position (up, down, left and right) provided that a valid move is available. X is the current maze position while A, B and C are the next possible moves. Please answer all the questions. S B A X G a) When X is the current node, which node(s) are in the corresponding list? When X is the current node, are the children node where in the visited list while in the yet to visit list

An A* search is used to solve the 8-puzzle problem game with heuristic h(n) as the number of tiles out of place. Please answer all the following questions a) The heuristic h(n) is admissible when h(n) => certainly underestimates b) Explain how is h(n) an informed heuristic in 8 puzzle game When a heuristic h(n) is more informed this means that the to return optimal solution.