Consider a modified version of the vacuum environment in Section 1.1, in which the geography of the environmentits extent, boundaries, and obstaclesis unknown, as is the initial dirt configuration. The agent can go Up and Down as well as Left and Right.

1. Can a simple reflex agent be perfectly rational for this environment? Explain. 2. Can a simple reflex agent with a randomized agent function outperform a simple reflex agent? Design such an agent and measure its performance on several environments.

3. Can you design an environment in which your randomized agent will perform poorly? Show your results. 4. Which search algorithm/s discussed in the lectures, if any, would be appropriate for the agent to employ to solve this problem? Should the algorithm use tree search or graph search?

5. A version of many search algorithms is already implemented in the code supplied with this assignment. Implement another version of your chosen algorithm/s to compute an optimal sequence of actions for a 3X3 world whose initial state has dirt in the three top squares and the agent in the centre. If your chosen algorithm has an already implemented version, compare the performance of both implementations.