This preview shows page 1. Sign up to view the full content.
Unformatted text preview: split it into two smaller non-empty heaps (no chips are removed). For instance, starting with one pile of 3 chips, you can move to one pile of 2 , 1 , 0 chips, or to two piles with 2 chips and 1 chip respectively. Consider Lasker’s Nim with a starting position of (1 , 2 , 3). Is this a P-position or an N-position? 4. If the given starting position in problem 3 is an N-position, what would be a winning move? 1...
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