This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3. Note that (1 , 2 , 3) denotes 3 piles of Lasker heaps, not nimheaps. By the sum theorem, g (1 , 2 , 3) = g 1 (1) g 2 (2) g 3 (3), where g 1 ,g 2 ,g 3 denote the SpragueGrundy functions of the single pile Laskers Nim games. Using the denition of the SpragueGrundy function, the values of the g i can be worked out. The only one dierent from regular nim is 3. Since, in addition to the usual nim moves, 3 can be split into the two smaller piles of sizes 2 and 1, we nd that the SpragueGrundy value of (3) is in fact 4. Thus we have g (1 , 2 , 3) = 1 2 4 = 7 and (1 , 2 , 3) is an Nposition for Laskers Nim. 4. The winning move is to split the pile with 3 chips into two smaller piles with 2 chips and 1 chip. This gives us the position (1 , 2 , 1 , 2) which has SpragueGrundy value 0....
View
Full
Document
This note was uploaded on 10/02/2009 for the course STAT 87531 taught by Professor Muralistoyanov during the Spring '09 term at University of California, Berkeley.
 Spring '09
 MURALISTOYANOV

Click to edit the document details