enter image description herecould you please help me answer this problem?
Two players alternate in placing dominoes on a 2 3 chess board so as to cover two squares exactly. The first to be unable to place a domino is the loser. Draw the game tree for this game (you can omit symmetric/rotated moves from the tree, just as I did in the lectures) and find a subgame-perfect NE. If players are rational, who wins the game, the first or the second mover?