On Mon, Oct 12, 2009 at 1:13 PM, Bharath Raghavendran <[email protected]> wrote: > > > 2009/10/12 Bharath Raghavendran <[email protected]> >> >> >> 2009/10/12 Paul Smith <[email protected]> >>> >>> Some observations: >>> >>> Every position is either a win for you or your opponent - the game >>> does not contain draws. >>> >>> Furthermore, the sub-game played from one consecutive set of biscuits >>> is entirely independent of the other sub-games. >>> >>> A single '1' is always winnable (b >= 1) >>> >>> A string of 1s is winnable if its length is less than b. >>> >>> A string of 0s is identical to a single 0 : 11100000000111 is the same >>> game as 1110111 >>> >>> A position is winnable if it contains an even number of unwinnable >>> sub-positions. >>> >> >> are you sure of this ? >>
No, in fact I am wrong :) -- Paul Smith http://www.nomadicfun.co.uk [email protected] --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/google-code?hl=en -~----------~----~----~----~------~----~------~--~---
