Skip to main content

Chapter 23 The Game of Nimble

Exercises Practice Problems

1.

Alice and Bob play the following games of Nimble. Alice goes first. Decide who has a winning strategy. Mark each game as "Alice Win" or "Bob Win" next to each board, as appropriate.

Solution.
  1. Alice win

  2. Bob win

  3. Alice win

  4. Alice win

  5. Bob win

  6. Alice win

2.

Create the complete game trees for positions (a) and (b) above. Label the leaves (terminal positions) as \(\cP\) and then work your way up the tree, marking each position with an \(\cN\) or a \(\cP\text{.}\) Remember to follow the two rules:

  • An \(\cN\)-position must have at least one follower that is a \(\cP\)-position.

  • Every follower of a \(\cP\)-position must be an \(\cN\)-position.

Solution.

3.

Create the complete game tree for position (c) above, as you did in problem 2. Mark each position with an \(\cN\) or a \(\cP\text{.}\) Once you are done, compare your answer to this problem with the trees in problem 2. Make any useful observations that you can. Solution.