I have the same question. It seems the S-G function doesn't work when there is a draw... ?
"Rajiv Mathews 写道： " > Is there a way to leverage this solution to handle more than one pile > of matches? > > Say there were k piles each containing n_1, n_2, ..., n_k matches, > with the same rules, that is only 1, 3 or 4 matches may be removed if > possible at a time, and there is a *draw* condition as defined before, > in addition to the winning and losing conditions. > > In general is there a way to extend the concept of nimbers/nim values > to handle drawn games? > > Regards, > Rajiv Mathews --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
