Fibonacci NIM

Set up: Put out some tokens. For a game that is always winable by the first player, put out a non-Fibonacci number of tokens.

Rules:

On the first turn, the player must take at least 1 token, and can't take all of the tokens

On every turn after the first turn of the game, the player must take at least 1 token, and at most twice as many as the person who went before him/her.

The person who takes the last token wins.

Sample game 1 (as played by clueless people):

Start with 12 tokens:

o o o o o o o o o o
o o                

The first player can take 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, or 11 tokens.

The first player takes 5 tokens:

ø ø ø ø ø o o o o o
o o                

The second player can take 1, 2, 3, 4, 5, 6, 7, 8, 9, or 10 tokens. The second player takes all of the remaining tokens, and wins

ø ø ø ø ø ø ø ø ø ø
ø ø                

 

Sample game 2 (as played by only slightly less clueless people).

Start with 12 tokens:

o o o o o o o o o o
o o                

The first player can take 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, or 11 tokens.

The first player takes 2 tokens:

ø ø o o o o o o o o
o o                

The second player can take 1, 2, 3, or 4. The second player takes 2 tokens

ø ø ø ø o o o o o o
o o                

The first player can now 1, 2, 3, or 4. The first player takes 1 token

ø ø ø ø ø o o o o o
o o                

The second player can take 1 or 2 tokens. The second player takes 2 tokens

ø ø ø ø ø ø ø o o o
o o                

The first player can take 1 or 2 tokens. The first player takes 1 token

ø ø ø ø ø ø ø ø o o
o o                

The second player can take 1 or 2 tokens. The second player takes 1 token

ø ø ø ø ø ø ø ø ø o
o o                

The first player realizes that no matter whether he/she takes 1 or 2 tokens, player 2 will still win at the next round, and concedes the game.

Sample game 3: How to Win. (Fred Fibonacci vs. Sam Sleepy)

Start with 12 tokens:

o o o o o o o o o o
o o                

Fred Fibonacci: The best Fibonacci sum for 12 is 12=8+3+1. Take 1 token.

ø o o o o o o o o o
o o                

Sam Sleepy (doomed no matter what he does): 11 tokens left. 11=8+3, but Sam can only take 1 or 2 tokens. Sam takes 1:

ø ø o o o o o o o o
o o                

Fred Fibonacci: 10 tokens left. The best Fibonacci sum for 10 is 10=8+2. Take 2 tokens.

ø ø ø ø o o o o o o
o o                

Sam Sleepy: 8 tokens left (which is a Fibonacci number). Sadly, Sam is not allowed to take 8. Sam can only take 1 or 2 tokens. Sam takes 2:

ø ø ø ø ø ø o o o o
o o                

Fred Fibonacci: 6 tokens left. The best Fibonacci sum for 6 is 6=5+1. Take 1 tokens.

ø ø ø ø ø ø ø o o o
o o                

Sam Sleepy: 5 tokens left (which is a Fibonacci number). Sadly, Sam is not allowed to take 5. Sam can only take 1 or 2 tokens. Sam takes 2:

ø ø ø ø ø ø ø ø ø o
o o                

Fred Fibonacci: 3 tokens left. 3 is a Fibonacci number. normally, that would be bad, but--WooHoo! Sam took 2 last time, so Fred is allowed to take all 3! He does, and wins!

ø ø ø ø ø ø ø ø ø ø
ø ø                

Sample game 4: showing winning moves for Fred

Player whose turn it is # tokens on the board What Fred is thinking # of tokens removed
Fred

24:
oooooooooo
oooooooooo
oooo

24=21+3 3
Sam 21:
oooooooooo
oooooooooo
o
(heh heh heh...) 6
Fred 15:
oooooooooo
ooooo
15=13+2 2
Sam 13:
oooooooooo
ooo
  1
Fred 12
oooooooooo
oo
12=8+3+1 1
Sam 11:
oooooooooo
o
  1
Fred 10:
oooooooooo
10=8+2 2
Sam 8:
oooooooo
  4
Fred 4:
oooo
Hm... I could take 1 beacause 4=3+1 OR I could take all 4... I think I'll take 4 I win!