QUESTION

Text
Image

# Consider the following simple game in Figure Q8 1 2 3 4 Figure Q8 This is a simple four-square game which involves two players. Player A moves first. The two players take turns moving, and each player must move his token to an adjacent space in either direction. If the opponent occupies an adjacent space, then he may jump over the opponent to the next open space (if any). For example, if A is on 1 and B is on 2, then A may jump over $B$ to 3 . The game ends when one of the players reaches the opposite end of the game board. $\mathbf{S}=$ Start node (initial state) $\mathbf{G}=$ Goal node Show all possible moves that can be performed by player A and B in ONE (1) search tree. Each node must be represented according to the following format: (position of token A, position of token B) Example: $(1,4)$ The above example represents a start state where token A is at position 1 and token B is at position 4. Each repetitive node should be marked with LOOP and you should not continue generating new nodes from this node. Each goal node should also be marked with END and you also should not continue generating new nodes from this node. (12 marks)  