FIGURE 5 - uploaded by Henry Fleischmann
Content may be subject to copyright.
Frequency Graph of the Number of Moves in 20,000 simulations of the Bergman Game with random moves when n = 2000 with the best fit Gaussian overlaid in red.
Source publication
Every positive integer may be written uniquely as any base-$\beta$ decomposition--that is a legal sum of powers of $\beta$--where $\beta$ is the dominating root of a non-increasing positive linear recurrence sequence. Guided by earlier work on a two-player game which produces the Zeckendorf Decomposition of an integer (see [Bai+15]), we define a br...
