acc1's blog

By acc1, 11 years ago, In English
I don't know whether this question is correct or not, but I needed to ask.

I was thinking of game of nim with a restriction that number of stones that are removed from a heap is a fibonacci number(>= 1).

Then, is there a algorithm that can tell who is the winner?.
(Assume normal play of game.)
 
 
 
 
  • Vote: I like it
  • -8
  • Vote: I do not like it

11 years ago, # |
  Vote: I like it 0 Vote: I do not like it
Solution can be built similarly. Nim function of number x is minimal non-negative integer, then there is no fibonacci number b, Nim(x-b) is equal of this number. Example:
0 - 0
1 - 1
2 - 2
3 - 3
4 - 0
5 - 1
...