Hei. Jeg sitter fast med en litt artig oppgave i game theory, og ville satt stor pris på hvis noen kunne hjelpe.
(Adapted from KEN BINMORE: Playing for Real, Oxford Press, 2007.) 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) and find a subgame-perfect NE. If players are rational, who wins the game, the first or the second mover?