---
title: Zeckendorf-Based Games
url: https://www.emergentmind.com/topics/zeckendorf-based-games
type: topic
---

# Zeckendorf-Based Games

A Zeckendorf-based game is a class of combinatorial games built around unique decompositions of positive integers as sums of non-consecutive terms from certain sequences, most commonly the Fibonacci numbers. Inspired by Zeckendorf’s theorem—which guarantees uniqueness of such decompositions—the canonical format involves two or more players alternately transforming a partition of a fixed integer, following strict local rules that mirror the recurrence relations of the underlying sequence. The game typically terminates at the legal Zeckendorf-type decomposition of the starting integer, with the last player to move declared the winner. Zeckendorf-based games have provided a fertile interface between additive number theory, combinatorial game theory, and the study of probabilistic and algorithmic processes on decompositions.

## 1. Fundamental Structures and Game Mechanics

**Zeckendorf’s theorem** asserts that every positive integer $n$ can be uniquely written as a sum of non-adjacent Fibonacci numbers $F_1=1$, $F_2=2$, $F_{k+1}=F_k + F_{k-1}$. The *Zeckendorf decomposition* of $n$ is thus a partition $n = F_{r_1}+F_{r_2}+\cdots+F_{r_{Z(n)}}$ with $r_{i+1} - r_i \geq 2$.

In the *classical Zeckendorf game* [1809.04881], the initial state is an unordered multiset of $n$ copies of $F_1$. Players alternate applying one of the following moves:
- **Merge consecutive**: Replace $F_{i-1}, F_i$ by $F_{i+1}$ for $i \geq 2$.
- **Split duplicates**: Replace $F_1, F_1$ by $F_2$; $F_2, F_2$ by $F_1, F_3$; or $F_i, F_i$ by $F_{i-2}, F_{i+1}$ for $i \geq 3$.

Each move strictly decreases an appropriate monovariant (e.g., the sum $\sum \sqrt{\mathrm{index}}$ over all pieces), ensuring that the game always terminates at the unique Zeckendorf decomposition [1809.04881]. The winner is the last player able to make a legal move.

**Generalizations** of the Zeckendorf game modify the sequence underlying the admissible decompositions—extending to arbitrary positive linear recurrences, non-constant recurrences, or even more complex combinatorial constraints [1809.04883, 2109.00117, 2009.12475].

## 2. The Classical, Ordered, and Reversed Variants

**Classical Zeckendorf Game (Unordered):**  
- Each state is a multiset.
- Player 2 has a non-constructive winning strategy for all $n > 2$ [1809.04881, 2211.14973].
- The minimum number of moves is $n - Z(n)$, and the maximal length is $O(n \log n)$; this bound has been sharpened to linear in $n$ in subsequent work [2006.16457, 2009.09510].

**Ordered Zeckendorf Game:**  
- The recent *Ordered Zeckendorf Game* imposes an order: the state is an ordered $n$-tuple $(F_1,\dots,F_1)$ [2508.20222].
- Only adjacent entries can be acted on; a *switch* move swaps out-of-order adjacent pairs.
- The introduction of ordered adjacency and switches disrupts mirroring strategies. For $n \leq 25$ (except $n=18$), Player 1 has a forcing win, a sharp reversal from the classical game [2508.20222].
- Termination is proven via the strictly decreasing monovariant $M(\sigma) = \sum_{j=1}^k (k+1-j) F_{i_j}$.
- Shortest-game length equals $n-Z(n)$, while longest-game asymptotics are quadratic: $M(n) \sim n^2/2$.

**Reversed Zeckendorf Game:**  
- Initiated at the Zeckendorf decomposition, players invert the moves until all parts are $F_1$ [2309.12748].
- Winning regions change radically: Player 1 has a winning strategy for $n = F_{i+1} + F_{i-2}$; more generally, the distribution of winners exhibits complex parity patterns.

## 3. Generalizations and Extensions

**To Other Linear Recurrences:**
- Games have been built on *k*-nacci numbers, generalized recursions $G_{n+1} = \sum c_i G_{n+1-i}$, and even nonconstant coefficient recurrences $a_{n+1} = n a_n + a_{n-1}$ [1809.04883, 2009.12475, 2109.00117, 2211.14973]. Decomposition rules, allowed moves, and termination monovariants are adapted to the structure of the underlying recurrence.
- For generalized Zeckendorf games, uniqueness of decomposition and finiteness are guaranteed under suitable conditions (e.g., positivity of coefficients) [1809.04883].

**To Geometric or Combinatorial Settings:**
- The *Fibonacci Quilt Game* relies on two-dimensional adjacency constraints, resulting in non-uniqueness, more elaborate allowed moves, and qualitative deviations such as multiple legal decompositions and strategic diversity [1909.01938].

**Black Hole Variants:**
- The *Black Hole Zeckendorf Games* restrict play to finite segments: pieces that would enter forbidden bins are removed ('black hole'). These modifications yield intricate modular winners and allow for fully constructive strategies for small $m$ [2409.10981].

## 4. Game-Theoretic and Algorithmic Properties

**Termination and Monovariants:**  
- All standard Zeckendorf-based games are finite by construction. Suitable monovariants (sum of indices, weighted sums, quadratic potentials) strictly decrease at each move, covering both unordered and ordered games [1809.04881, 2508.20222, 2109.00117].
- In the ordered case, the monovariant $M(\sigma)$ bounds the maximal length by $\binom{n}{2}$, which is tight up to lower-order terms [2508.20222].

**Move-Count Bounds:**  
- Minimal game length is achieved by greedy merging, always reducing the number of summands by 1: minimal length is $n-Z(n)$.
- Maximal game length is realized by maximal splitting; for the unordered game this is now linear in $n$ (sharp bound: $3n-3Z(n)-IZ(n)+1$ [2006.16457, 2009.09510]), while for the ordered variant it is quadratic [2508.20222].
- For the generalized Bergman game on PLRS, longest plays are $\Theta(n^2)$ [2109.00117].

**Complexity and Algorithmics:**  
- For ordered/unordered games, finding shortest and longest plays is algorithmically tractable due to greedy characterizations [2009.12475, 2006.16457].
- However, determining explicit winning strategies is nontrivial: in the classical game, the Player 2 win exists but lacks an explicit protocol for large $n$ [1809.04881, 2211.14973].

## 5. Strategic, Probabilistic, and Multiplayer Behavior

**Strategic Outcomes:**
- Classical Zeckendorf Game: Player 2 has a winning strategy for $n > 2$, but this strategy is non-constructive and not explicitly known for large $n$ [1809.04881, 2211.14973].
- Ordered Zeckendorf Game: Player 1 wins in nearly all small $n$ due to adjacency and switching constraints [2508.20222].
- Reversed Zeckendorf: Winner alternates in a nontrivial, parity-governed pattern [2309.12748].
- Games built on generalized or non-constant recurrences often admit both parities of game-length, so either player can win for suitable $n$ [2009.12475, 2211.14973].

**Random Play and Probabilistic Phenomena:**
- Randomized Zeckendorf games, where moves are chosen uniformly at random, typically exhibit move-length distributions approaching Gaussianity or log-normality as $n \to \infty$ [2210.11038, 2508.20222, 1909.01938].
- Under random play, win/loss frequencies converge to $50$–$50$ as $n$ grows [2210.11038, 2508.20222].

**Multiplayer and Alliances:**
- For $p \geq 3$ players (classical unordered), no player has a winning strategy for $n \geq 5$. For $p \geq 4$ or sufficiently large $n$, coalitions too small cannot force a win; sufficiently large alliances can [2009.03708, 2211.14973, 2009.12475].
- Existence and classification of winning strategies generalize to more complex alliances, with explicit thresholds depending on recurrence parameters and partition sizes [2009.03708, 2211.14973].

## 6. Open Problems and Future Directions

- **Constructive Winning Strategies:** The lack of explicit winning strategies for the unordered Zeckendorf game remains an open problem. Recent work in ordered and modified variants provides analogues with more tractable strategy spaces [2508.20222, 2409.10981].
- **Gaussianity in Move Distributions:** The conjecture that move-length in random play approaches a Gaussian law for Zeckendorf and broader recurrence-based games is supported by partition-based analyses but remains unresolved in full generality [2210.11038].
- **Extensions to Arbitrary Recurrences:** A unified approach to Zeckendorf-type games on arbitrary positive or nonconstant recurrences continues to pose challenges, particularly for explicit move-count bounds, winner classifications, and alliance strategies [2009.12475, 2109.00117, 2211.14973].
- **Complexity and Algorithmic Questions:** Determining worst-case or average-case complexity for arbitrary Zeckendorf-based games, and constructing efficient algorithms for optimal play, remain active areas of study.

## 7. Comparative Table of Key Zeckendorf-Based Games

| Game Variant                  | Sequence            | State Structure    | Key Move Constraint     | Player Win (Small $n$)            | Shortest Length | Longest Length            |
|-------------------------------|---------------------|--------------------|------------------------|-----------------------------------|-----------------|--------------------------|
| Classical Zeckendorf          | Fibonacci           | Unordered multiset | Any occurrence         | Player 2 ($n > 2$), non-constructive | $n-Z(n)$        | $O(n)$, tight bounds known|
| Ordered Zeckendorf            | Fibonacci           | Ordered tuple      | Adjacent only, switches| Player 1 ($n \leq 25$, $n \neq 18$) | $n-Z(n)$        | $\sim n^2/2$             |
| Generalized Zeckendorf        | PLRS, $k$-bonacci   | Unordered multiset | Local, per recurrence  | Varies per $(c,k)$, parity dependent | $\Theta(n)$     | $\Theta(n)$ or higher    |
| Nonconstant Recurrence        | $a_{n+1} = n a_n + a_{n-1}$| Unordered | Local, per recurrence  | Both players can win; parity exists   | $<0.78 n$       | Not specified            |
| Reversed Zeckendorf           | Fibonacci           | Partition in bins  | Inverted moves         | Complex, parity-governed           | $n-Z(n)$        | $\sim \phi^2 n$          |
| Fibonacci Quilt               | FQ sequence         | Unordered quilt    | 2D adjacency, not unique| Either player for $n > 5$         | $n-L(n)$         | Variable                 |
| Black Hole Zeckendorf         | Fibonacci           | Truncated bins     | Disallowed bins, modular| Modular winners (explicit)         | —                | —                        |

This comparative table summarizes basis sequence, state representation, move constraints, winner for small $n$, and basic move-count bounds for the prominent Zeckendorf-based games ([2508.20222], [1809.04881], [2109.00117], [2009.12475], [2309.12748], [1909.01938], [2409.10981]).

---

Zeckendorf-based games constitute a unifying framework for exploring additive structures through local move rules. They connect combinatorial game theory and number theory, support deep results on unique representations, winning strategies, game complexity, and probabilistic behavior, and catalyze ongoing research across generalizations, alliance settings, and algorithmic aspects [2508.20222, 1809.04881, 2210.11038, 2211.14973, 2109.00117, 2009.12475, 2006.16457, 2009.09510, 2309.12748, 1909.01938, 2409.10981].

Source: https://www.emergentmind.com/topics/zeckendorf-based-games