Problem 3: You are given a game which has the following rules: You have a single token x, and it can move, I Two squares right which has to follow with 1 square up or down (ex: if the token {x} in {2,3} goes to right1 it should also either go to {4,2} or {4

Subject:Computer SciencePrice:3.86 Bought8

Share With

Problem 3: You are given a game which has the following rules: You have a single token x, and it can move, I Two squares right which has to follow with 1 square up or down (ex: if the token {x} in {2,3} goes to right1 it should also either go to {4,2} or {4.4" I Two squares left which has to follow with 1 square up or down I Two squares up which has to follow with 1 square right or left I Two squares down which has to follow with 1 square right or left 23455 D III...- 1 III...- 2 III...- 3 I-?-I-I 4 III...- 5 III...- 6 III...- a} Provide an admissible heuristic, means it should be admissible tor a given any start state to any goal state {example below]. Please provide your heuristic like a formula and then explain the formula if it is needed with an example mm more than 2 sentences] (it) points} {in the example the ?rst gn'd is a start state and the second grid is a goal state)| b} Independent than the above problem. Assume that for anv game, the actual cost from start state to the goal state is 51:}. You have two admissible heuristics which h1 have an estimate 4t] and h2 has an estimate 3t]. 1|.r'li'hich one of the two admissible heuristic would you choose to use in your algorithm for a better solution? Explain the reason in two sentences {answer with no explanation will not get any point} (10 points]