Fibonacci Nim
作者：互联网
目录
题意
取石子，但是：
- 先手第一次可取任意多个石子
- 此外每次可取的石子的个数，至少为 \(1\) ，至多为上一轮对方所取个数的 \(2\) 倍
求先手第一次取石子最少取多少可保证获胜
题解
先鸽着
相关
arXiv:
- GRUNDY VALUES OF FIBONACCI NIM - URBAN LARSSON AND SIMON RUBINSTEIN-SALZEDO
- GLOBAL FIBONACCI NIM - URBAN LARSSON AND SIMON RUBINSTEIN-SALZEDO
OEIS:
- A054736 Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".
- A052492 Initial pile sizes that guarantee a win for player 2 in a variant of Fibonacci NIM where the players may not take one stone.
- A120904 Odd winning positions in Fibonacci nim.
- A001581 Winning moves in Fibonacci nim.
- A014588 Nim function for Take-a-Fibonacci-Game (a subtraction game).
UOJ:
cnblogs:
csdn:
标签：题意,NIM,题解,石子,Fibonacci,Nim 来源： https://www.cnblogs.com/CDOI-24374/p/15909037.html