d. 2 Points] Lost at Night: It is night and you control a single insect. You know the maze, but you do not know what square the insect will start in. Let M be the set of non-wall squares in the maze, ie. IMI = N. You must pose a search problem whose solution is an all-purpose sequence of actions such that, after executing those actions, the insect will be on the exit square, regardless of initial position. The insect executes the actions mindlessly and does not know whether its moves succeed: if it uses an action which would move it in a blocked direction, it will stay where it is. For example, in the maze below, moving left twice and then right twice guarantees that the insect will be at the exit regardless of its starting position. State space description: State space size: Maximum branching factor: Heuristic: e. [2 Points] Escape! Your insect is again alone in a maze, but certain squares are filled with pesticide, shown below in green. Those squares are safe to travel through provided the insect does not accumulate more than L time steps in the pesticide, at which point it would die. You must find a solution where no more than L pesticide squares are used. State space description: State space size: Maximum branching factor: Heuristic: d. 2 Points] Lost at Night: It is night and you control a single insect. You know the maze, but you do not know what square the insect will start in. Let M be the set of non-wall squares in the maze, ie. IMI = N. You must pose a search problem whose solution is an all-purpose sequence of actions such that, after executing those actions, the insect will be on the exit square, regardless of initial position. The insect executes the actions mindlessly and does not know whether its moves succeed: if it uses an action which would move it in a blocked direction, it will stay where it is. For example, in the maze below, moving left twice and then right twice guarantees that the insect will be at the exit regardless of its starting position. State space description: State space size: Maximum branching factor: Heuristic: e. [2 Points] Escape! Your insect is again alone in a maze, but certain squares are filled with pesticide, shown below in green. Those squares are safe to travel through provided the insect does not accumulate more than L time steps in the pesticide, at which point it would die. You must find a solution where no more than L pesticide squares are used. State space description: State space size: Maximum branching factor: Heuristic
