Consider the following board $($as example$)$ where we have two players

one moves the X and his opponent moves the Y$.$ each player can move

his letter one tile up$,$ down, left, right or diagonal. The blocked tiles

can$$t be reached. Also, the visited tile can$$t be visited more than two

times. The player is considered to be a winner if the opponent does not

have a legal move. The board can be of any two dimensions and the

number of blocks and their positions are randomly generated at the

beginning of the game. Describe the state space representation of this problem.

b$.$ Write the proper rules.

c$.$ Draw a tree that represents the possible movements.

d$.$ Propose a heuristic function for this game.