Grundy values of Fibonacci Nim

DOI10.1007/S00182-015-0473-YzbMATH Open1388.91078arXiv1410.0332OpenAlexW2053224708WikidataQ56673742 ScholiaQ56673742MaRDI QIDQ328554FDOQ328554

Simon Rubinstein-Salzedo, Urban Larsson

Publication date: 20 October 2016

Published in: International Journal of Game Theory (Search for Journal in Brave)

Abstract: In this article, we investigate the Grundy values of the popular game of Fibonacci nim. The winning strategy, which amounts to understanding positions of Grundy value 0, was known since Whinihan in 1963. In this paper, we extend Whinihan's analysis by computing all the positions of Grundy value at most 3. Furthermore, we show that, when we delete the Fibonacci numbers (which have Grundy value 0), the Grundy values of the starting positions are increasing, and we give upper and lower bounds on the growth rate.

Full work available at URL: https://arxiv.org/abs/1410.0332

Recommendations

• Fibonacci Nim and a full characterization of winning moves
• scientific article
• Winning Nim with Beatty and Fibonacci
• Global Fibonacci nim
• scientific article; zbMATH DE number 815555

zbMATH Keywords

Fibonacci numberscombinatorial game theoryZeckendorf's theorem

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Combinatorial games (91A46)

Cites Work

• Winning ways for your mathematical plays. Vol. 1.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• The game of \(n\)-times nim
• Global Fibonacci nim
• Adjoining to (K,s,t)-Wythoff's game its P-generators as moves

This page was built for publication: Grundy values of Fibonacci Nim

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328554)