Consider a game tree in which there are six marbles, and players 1 and 2 take turns picking from one to three marbles. The player who takes the last marble loses the game.
a. Draw the complete game tree for this game.
b. If the game tree were searched using the alphabeta pruning technique, and nodes representing configurations with the smallest number of marbles are searched first, which nodes are pruned?
c. Who wins the game if both play their best?