Dominos can be placed on an m by n board so as to cover two squares exactly. Two players alternate in doing this. The first to be unable to place a domino is the loser. For each case below draw the game tree and identify, with justifications, the player who has a winning strategy. Hint: the conclusion reached in a case might help in the next. (a) m = 2 and n = 2 (b) m = 3 and n = 2 (c) m = 4 and n = 2 (d) m = 2 and n =5 (e) m = n = 3.
