A limit that changes every turn
After a player removes x counters, the next player may take from one through 2x counters, capped by the remaining pile. A small take restricts the reply; a large take opens more options.
Take the final counter while controlling the changing upper limit on each move.
Your unfinished game is saved only in this browser.
Take the final counter while controlling the changing upper limit on each move.
Complete guide
Fibonacci Nim begins with one pile. The first player may not take the whole pile; afterward, each take may be no larger than twice the previous take. The final counter wins.
After a player removes x counters, the next player may take from one through 2x counters, capped by the remaining pile. A small take restricts the reply; a large take opens more options.
The first move must leave at least one counter. This prevents an immediate trivial win and creates the first response limit from the number you choose to take.
Every positive integer can be represented as a sum of nonconsecutive Fibonacci numbers. The smallest term in that representation helps identify useful moves and explains the game's name.
Removing many counters is not always progress because it expands the computer's legal range. Compare the pile remaining with twice your proposed take and avoid granting an immediate finish.
The opening rule requires a proper take, so at least one counter must remain after the first move.
A player may take at most twice the number removed on the immediately preceding turn.
The player who legally removes the final counter wins.