The quiz lasts 75 minutes and covers everything from lessons 1-12.

- For each of the following Nim games, find one good move for the first player, if any. (10 points) [
*Note : exactly one of the games is a win for the second player.*]- (5, 7, 8)
- (3, 4, 8, 9)
- (3, 5, 10, 12)
- (1, 6, 8, 9, 10)

- Consider the following Wythoff’s Queen game on a non-square board. Start with exactly one Queen. At each player’s turn, he picks up the Queen and moves it in one of the three indicated directions, any positive number of squares. The player who lands the Queen on the bottom-left hand corner wins, since the opponent is unable to make any move. Indicate whether each of the following 36 positions is winning or losing. (10 points)

- Consider the game sum
*G*+*H*.- Find
*G*,*H*, such that*G*|| 0,*H*|| 0, and*G*+*H*= 0. - Find
*G*,*H*, such that*G*|| 0,*H*|| 0, and*G*+*H*|| 0. - Find
*G*,*H*, such that*G*|| 0,*H*|| 0, and*G*+*H*> 0. - Find
*G*,*H*, such that*G*|| 0,*H*|| 0, and*G*+*H*< 0. (8 points)

- Find
- Consider the following partial games:

*A* = {3/8 | 1}, *B* = {-3/2 | -1/2}, *C* = {1/16 | 1/2}, *D* = {0 | 3/4}.

- These four games are all numbers. Find their values with the Simplicity Rule and show that
*A*+*B*+*C*+*D*> 0. *Left*starts in the sum*A*+*B*+*C*+*D*and he can win. Among the four components*A*,*B*,*C*and*D*, which one should he move in? Write down all possibilities.*Left*made a move in*D*. Which component should*Right*move in, now that it’s his turn? (12 points)- Given the following Toads-and-Frogs configurations:

compute the following configurations (*hint: for the first one, do not consider its options*). Check that the last game is fuzzy. (12 points)

- Compare the following games, and decide whether
*G*>*H*,*G*<*H*,*G*=*H*or*G*||*H*. (Hint: it may help to analyse the game*G*–*H*). (24 points)*G*= 1/8,*H*= -3/4;*G*= 300↑,*H*= 1/8;*G*= *1904,*H*= *2008;*G*= 3/4 + 2↓ + (*5),*H*= 3/4 + 3↓ + (*4);*G*= 3/4 + 2↓ + (*6),*H*= 3/4 + 3↓ + (*5);*G*= {5 | 2},*H*= 3;*G*= {5 | 2},*H*= 1;*G*= {5 | 2},*H*= {7 | 3};*G*= { {10 | 5} | {-2 | -3} },*H*= 0;*G*= { {0|4}, {1|2} | {4|7}, {5|6} },*H*= 3;*G*= {8 | 0} + {-1 | -5},*H*= {2 | -4} + {5 | 3}.

- Recall the game of
*Cutcakes*: given a cake, divided into*m*×*n*unit squares, each player at his turn takes a piece of cake and slices it along the edges of the squares, thus dividing the cake into two pieces. In addition,*Left*can only cut vertically, while*Right*can only cut horizontally. The values for*m*×*n*Cutcakes are given below: e. g. for a 6 × 8 cake, the value is -1.

- Based on the above grid, guess the values for 32 ×
*n*for*n*= 1, 3, 6, 10, 15, 21, 28. - On a 7 × 9 cake, the value is -1, so
*Right*wins. Find all possible winning moves for*Right*if he starts. - In the midst of the game, there are three cakes of sizes 3 × 10, 8 × 6 and 13 × 5 left,

together with some unit pieces. Given it is now*Right*‘s turn, can he win? If yes, find a winning move for him. (14 points)

**Notes**

- The class scored an average of 73.1 with a standard deviation of 13.4, out of a class of 20+ students.
- I added hints liberally throughout the final quiz; on hindsight these were probably a little unnecessary since the average score ended up approximately the same.