The figure above shows a robotic with a function to clean up a house. The robot is equipped with a sensor that can receive a percept dirt (signifying that there is dirt beneath it), or null (indicating no special information). The robot always has a definite orientation (one of north, south, east or west). In addition to being able to suck up dirt, the robot can move forward one step or turn right 90^o. The robot moves round a room, which is divided grid-like into a number of equally sized squares of 3 x 3, and it always start in grid square (0,0) facing north. The goal is to traverse the room continually searching for and removing dirt.

Given an initial environment.

In(x, y) robot is at (x, y)

Dirt(x, y) there is dirt at (x, y)

Facing(d) robot is facing direction d

Write all possible rules starting from (0,0) until (3,3) to indicate the actions performed by the robot. The rules dealing with the traversal up to (0,2) are given below

dirt: dirt (0,2) (2,2) (0,0) (2,0) dirt: dirt (0,2) (2,2) (0,0) (2,0)