CS 340 Lab 3 - Games

Consider the game “Last one Loses” which starts with a stack of n pennies. Two players alternate moves in which a player may remove up to k pennies from the stack but must remove at least 1. The player stuck with the last move is the loser.

Draw the complete game tree for n=9 and k=3. Show that the second player can always force a win.