SpragueGrundy theorem

#	Item
1	Take One or Two December 2, 2015 Consider the following game. The board consists of n tokens. At each turn, a player must take either 1 or 2 tokens off the board (which are discarded). The player who takes the last token Add to Reading List Source URL: math.colorado.edu Language: English - Date: 2015-12-04 19:21:56 Combinatorial game theory Mathematical induction Token coin Mathematical proof Mathematical games Hot game SpragueGrundy theorem