Hamlet the hamster has a deluxe, two room cage. There is an opening between the two sections of the cage. Hamlet can move right, move left, and eat. When Hamlet eats, he doesn't stop until all the food is gone. If movement can bring him to the next room, it does so Food can only be in one section of the cage Hamlet's goal is to find and cat all the food. Therefore, the goal states are States 5 and 6. Assume Hamlet's world is accessible. This means he knows his can cut state, if he is in a goal state, and what each action does. If Hamlet is in State 3. find the shortest path to a goal state. Hamlet can check for repeated states, therefore any state that is repeated is not expanded further. What search method guarantees that Hamlet will find an optimal solution? Assume the world is no longer accessible since Hamlet lias gotten old and lost all of his perceptual abilities (he can't hear. see. or smell!). We now have a multistate problem If we are given a set of initial states (State 1. State 2. Stated. State 4) find a path Hamlet can take that will always guarantee he reaches his goal (State 5 or State 6 or both). Hamlet can check for repeated states, therefore any state that is repeated is not expanded further. For example: {1, 2, 3, 4} Hamlet the hamster has a deluxe, two room cage. There is an opening between the two sections of the cage. Hamlet can move right, move left, and eat. When Hamlet eats, he doesn't stop until all the food is gone. If movement can bring him to the next room, it does so Food can only be in one section of the cage Hamlet's goal is to find and cat all the food. Therefore, the goal states are States 5 and 6. Assume Hamlet's world is accessible. This means he knows his can cut state, if he is in a goal state, and what each action does. If Hamlet is in State 3. find the shortest path to a goal state. Hamlet can check for repeated states, therefore any state that is repeated is not expanded further. What search method guarantees that Hamlet will find an optimal solution? Assume the world is no longer accessible since Hamlet lias gotten old and lost all of his perceptual abilities (he can't hear. see. or smell!). We now have a multistate problem If we are given a set of initial states (State 1. State 2. Stated. State 4) find a path Hamlet can take that will always guarantee he reaches his goal (State 5 or State 6 or both). Hamlet can check for repeated states, therefore any state that is repeated is not expanded further. For example: {1, 2, 3, 4}