Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Fibonacci nim
open-in-new
<h2 id="rules-and-history">Rules and history</h2> <p>Fibonacci nim is played by two players, who alternate removing coins or other counters from a pile. On the first move, a player is not allowed to take all of the coins, and on each subsequent move, the number of coins removed can be any number that is at most twice the previous move. According to the <a href="/facts/Normal_play_convention/9yBfAzRc">normal play convention</a>, the player who takes the last coin wins.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a> </p><p>The game was first described by Michael J. Whinihan in 1963, crediting its invention to <a href="/facts/Oregon_State_University/FR0MGWWg">Oregon State University</a> mathematician Robert E. Gaskell. It is called Fibonacci nim because the <a href="/facts/Fibonacci_number/mqxpAUQD">Fibonacci numbers</a> feature heavily in its analysis.<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> </p><p>This game should be distinguished from a different game, also called Fibonacci nim, in which players may remove any Fibonacci number of coins on each move.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a> </p> <h2 id="strategy">Strategy</h2> <p>The strategy for best play in Fibonacci nim involves thinking of the current number of coins as a sum of <a href="/facts/Fibonacci_number/mqxpAUQD">Fibonacci numbers</a>.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> There are many ways of representing numbers as sums of Fibonacci numbers, but only one representation that uses each Fibonacci number at most once, and avoids consecutive pairs of Fibonacci numbers; this unique representation is known as its <a href="/facts/Zeckendorf%27s_theorem/hg8s2ycr">Zeckendorf representation</a>. For instance, the Zeckendorf representation of 10 is 8 + 2; although 10 can also be represented as sums of Fibonacci numbers in other ways, such as 5 + 5 or 5 + 3 + 2, those other ways do not meet the condition of only using each Fibonacci number once and avoiding consecutive pairs of Fibonacci numbers such as the pairs 2, 3 and 3, 5. The Zeckendorf representation of any number may be found by a <a href="/facts/Greedy_algorithm/alfsekco">greedy algorithm</a> that repeatedly subtracts the largest Fibonacci number possible, until reaching zero.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p><p>The game strategy also involves a number called the "quota", which may be denoted as q. This is the maximum number of coins that can currently be removed. On the first move, all but one coin can be removed, so if the number of coins is n then the quota is <i>q</i> = <i>n</i> − 1. On subsequent moves, the quota is two times the previous move.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> </p><p>Based on these definitions, the player who is about to move can win whenever q is greater than or equal to the smallest Fibonacci number in the Zeckendorf representation, and will lose (with best play from the opponent) otherwise. In a winning position, it is always a winning move to remove all the coins (if this is allowed) or otherwise to remove a number of coins equal to the smallest Fibonacci number in the Zeckendorf representation. When this is possible, the opposing player will necessarily be faced with a losing position, because the new quota will be smaller than the smallest Fibonacci number in the Zeckendorf representation of the remaining number of coins.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a> Other winning moves may also be possible.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> However, from a losing position, all moves will lead to winning positions.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p><p>The Zeckendorf representation of a Fibonacci number consists of that one number. So when the starting pile has a Fibonacci number n of coins, the smallest Fibonacci number in the Zeckendorf representation is just n, larger than the starting quota <i>n</i> − 1. Therefore, a Fibonacci number as the starting pile is losing for the first player and winning for the second player. However, any non-Fibonacci starting number of coins has smaller Fibonacci numbers in its Zeckendorf representation. These numbers are not larger than the starting quota, so whenever the starting number of coins is not a Fibonacci number, the first player can always win.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> </p> <h2 id="example">Example</h2> <p>For example, suppose that there are initially 10 coins.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> </p> <ul><li>The Zeckendorf representation of 10 is 10 = 8 + 2, and the initial quota is 9, larger than the smallest Fibonacci number 2 in the Zeckendorf representation, so the first player can win. One winning move by the first player would be to remove the smallest Fibonacci number in this representation, 2, leaving 8 coins.</li> <li>After this move, there are 8 coins left, with Zeckendorf representation 8, and the new quota is 4, meaning that the second player can remove at most 4 coins, not enough to reach the smallest number in the Zeckendorf representation. Removing 3 or 4 coins would allow the first player to win immediately; suppose instead that the second player takes 2 coins.</li> <li>This leaves 6 = 5 + 1 coins, with a quota of 4, larger than the 1 in the Zeckendorf representation. The first player can again takes the smallest Fibonacci number in this representation, 1, leaving 5 coins.</li> <li>With a pile of 5 coins, the Zeckendorf representation is 5, but the quota is 2, a smaller number. The second player could take two coins, but that would again lose immediately, so suppose that the second player takes only one coin.</li> <li>After this move, the number of coins is 4 = 3 + 1, and the quota is 2. The first player again takes the smallest Fibonacci number in the Zeckendorf representation, 1, leaving 3 coins.</li> <li>Now, regardless of whether the second player takes one or two coins, the first player will win the game in the next move.</li></ul> <h2 id="multiple-piles">Multiple piles</h2> <p>Fibonacci nim is an <a href="/facts/Impartial_game/kQWPKPGv">impartial game</a> in that the moves that are available from any position do not depend on the identity of the player who is about to move. Therefore, the <a href="/facts/Sprague%E2%80%93Grundy_theorem/0ED4gBMY">Sprague–Grundy theorem</a> can be used to analyze an extension of the game in which there are multiple piles of coins, and each move removes coins from only one pile (at most twice as many as the previous move from the same pile). For this extension, it is necessary to compute the <a href="/facts/Nim-value/0ED4gBMY">nim-value</a> of each pile; the value of the multi-pile game is the <a href="/facts/Nim-sum/jjW5SVmm">nim-sum</a> of these nim-values. However, a complete description of these values is not known.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> </p><p>A different multiple-pile variant of the game that has also been studied limits the number of stones in each move to twice the number from the previous move, regardless of whether that previous move was to the same pile.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> </p> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Vajda, Steven (2007), "Fibonacci nim", Mathematical Games and How to Play Them, Dover Books on Mathematics, Courier Corporation, pp. 28–29, ISBN 9780486462776 <a href="9780486462776" target="_blank">9780486462776</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Whinihan, Michael J. (1963), "Fibonacci Nim" (PDF), Fibonacci Quarterly, 1 (4): 9–13 <a href="http://www.fq.math.ca/Scanned/1-4/whinihan.pdf" target="_blank">http://www.fq.math.ca/Scanned/1-4/whinihan.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>For the game of subtracting Fibonacci numbers of coins, see Alfred, Brother U. (1963), "Exploring Fibonacci numbers" (PDF), Fibonacci Quarterly, 1 (1): 57–63, "Research project: Fibonacci nim", p. 63; Pond, Jeremy C.; Howells, Donald F. (1963), "More on Fibonacci nim" (PDF), Fibonacci Quarterly, 1 (3): 61–62 <a href="http://www.fq.math.ca/Scanned/1-1/alfred3.pdf" target="_blank">http://www.fq.math.ca/Scanned/1-1/alfred3.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Whinihan, Michael J. (1963), "Fibonacci Nim" (PDF), Fibonacci Quarterly, 1 (4): 9–13 <a href="http://www.fq.math.ca/Scanned/1-4/whinihan.pdf" target="_blank">http://www.fq.math.ca/Scanned/1-4/whinihan.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Graham, Ronald L.; Knuth, Donald E.; Patashnik, Oren (1994), Concrete Mathematics (2nd ed.), Addison-Wesley, pp. 295–296, ISBN 0-201-55802-5 <a href="0-201-55802-5" target="_blank">0-201-55802-5</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>Whinihan, Michael J. (1963), "Fibonacci Nim" (PDF), Fibonacci Quarterly, 1 (4): 9–13 <a href="http://www.fq.math.ca/Scanned/1-4/whinihan.pdf" target="_blank">http://www.fq.math.ca/Scanned/1-4/whinihan.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Whinihan, Michael J. (1963), "Fibonacci Nim" (PDF), Fibonacci Quarterly, 1 (4): 9–13 <a href="http://www.fq.math.ca/Scanned/1-4/whinihan.pdf" target="_blank">http://www.fq.math.ca/Scanned/1-4/whinihan.pdf</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Allen, Cody; Ponomarenko, Vadim (2014), "Fibonacci Nim and a full characterization of winning moves", Involve, 7 (6): 807–822, doi:10.2140/involve.2014.7.807 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>Whinihan, Michael J. (1963), "Fibonacci Nim" (PDF), Fibonacci Quarterly, 1 (4): 9–13 <a href="http://www.fq.math.ca/Scanned/1-4/whinihan.pdf" target="_blank">http://www.fq.math.ca/Scanned/1-4/whinihan.pdf</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Vajda, Steven (2007), "Fibonacci nim", Mathematical Games and How to Play Them, Dover Books on Mathematics, Courier Corporation, pp. 28–29, ISBN 9780486462776 <a href="9780486462776" target="_blank">9780486462776</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>The fact that 2 is the unique winning move from this starting position, and the Zeckendorf representations of all pile sizes arising in this example, can be seen in Allen & Ponomarenko (2014), Table 1, p. 818. - Allen, Cody; Ponomarenko, Vadim (2014), "Fibonacci Nim and a full characterization of winning moves", Involve, 7 (6): 807–822, doi:10.2140/involve.2014.7.807 <a href="https://doi.org/10.2140%2Finvolve.2014.7.807" target="_blank">https://doi.org/10.2140%2Finvolve.2014.7.807</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Larsson, Urban; Rubinstein-Salzedo, Simon (2016), "Grundy values of Fibonacci nim", International Journal of Game Theory, 45 (3): 617–625, arXiv:1410.0332, doi:10.1007/s00182-015-0473-y, MR 3538534, S2CID 206890376 <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>Larsson, Urban; Rubinstein-Salzedo, Simon (2018), "Global Fibonacci nim", International Journal of Game Theory, 47 (2): 595–611, doi:10.1007/s00182-017-0574-x, MR 3842045, S2CID 52073784 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> </ol>