Answer Happy

Iswer the following questions in order: - Consider the following board for a two player game (A and B) in its starting position: Rules: Player A moves first. The two players take turns moving, and each player must move his token vertically or horizontallyto an open adjacent space. A player can only move to one open space at a time, and cannot move to an occupied space. The game ends when one player reaches any space on the opposite side of the board -i.e player A gets to any space in row 3, or player B gets to any space in row 1, or when both players have played twice. The scoring is the Manhattan distance from B to the closest space on the opposite side (row) minus the Manhattan distance from A to the closest space on its opposite side (row )1, or Manhattan (B, Goal )− Manhattan (A,Goal). See some examples in the next section. - Draw the complete game tree using the following conventions: (30pts) * Draw the grid corresponding to each state * Put each terminal state in a square box and write its game value in a circle * Put loop states (states that already apear on the path to the root) in double square boxes. - Now, mark each node with its backed-up minimax value (in a circle)(10pts) - If the game were to continue until one player reaches the other side, explain how the game tree would be modified and how the standard minimax algorithm would fail on this game tree ( 15pts )