The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph

TL;DR

We address a parity-constrained variant of the four-peg Tower of Hanoi, where two pegs are neutral and two enforce parity restrictions. The authors develop a coupled recurrence framework for four objective move counts $a_n,b_n,c_n,d_n$, obtain higher-order recurrences and closed forms, and prove their exponential but sub-3-peg growth, with $a_n= ext{}$Θ$((\\sqrt{2})^n)$. They also define parity-constrained Hanoi graphs $P^n$, deriving vertex counts $|V(P^n)|=3^n$, edge counts, and a rich set of topological properties including containment $H_3^{\lceil n/2\rceil}\subseteq P^n\subseteq H_4^n$, Hamiltonicity, planarity thresholds, and chromatic/edge-coloring results. The work reveals how parity constraints slow the classic exponential growth and yields a comprehensive graph-theoretic view of constrained Hanoi dynamics, with potential generalizations to more pegs or modular constraints. The findings bridge recursive optimization, parity-driven state spaces, and Hanoi-graph theory, offering both exact and asymptotic insights along with constructive paths for Hamiltonian cycles and colorings.

Abstract

We introduce and study a new four-peg variant of the Tower of Hanoi problem under parity constraints. Two pegs are neutral and allow arbitrary disc placements, while the remaining two pegs are restricted to discs of a prescribed parity: one for even-labelled discs and the other for odd-labelled discs. Within this constrained setting, we investigate four canonical optimization objectives according to distinct target configurations and derive for each the exact number of moves required to optimally transfer the discs. We establish a coupled system of recursive relations governing the four optimal move functions and unfold them into higher-order recurrences and explicit closed forms. These formulas exhibit periodic growth patterns and reveal that all solutions grow exponentially, but at a significantly slower rate than the classical three-peg case. In particular, each optimal move sequence has an a half-exponential-like asymptotic order induced by the parity restriction. In addition, we define the associated parity-constrained Hanoi graph, whose vertices represent all feasible states and whose edges represent legal moves. We determine its order, degrees, connectivity, planarity, diameter, Hamiltonicity, clique number, and chromatic properties, and show that it lies strictly between the classical three- and four-peg Hanoi graphs via the inclusion relation.

Figures (5)

• Figure 1: Illustration of the four main objectives (a)--(d). Green: entire tower; blue: even sub-tower; yellow: odd sub-tower.
• Figure 2: Comparison of the parity-constrained sequences $a_n$, $b_n$, $c_n$, $d_n$ with the classical three-peg and four-peg optima $h_{3}^{n}$ and $h_{4}^{n}$, and the sequence $(\sqrt{2}^{n})_{n\geq 0}$.
• Figure 3: The graphs $P^1$, $P^2$, and $P^3$. Red edges represent moves of the largest disc. Dashed edges show the optimal path for objective (a). The red circle marks the initial state; green circles mark the final states of objectives (a)--(d).
• Figure 4: Two embeddings of a subdivision of $K_{3,3}$ contained in $P_{3}$.
• Figure 5: Largest Hanoi subgraph (isomorphic to $H^{\lceil n/2\rceil}_3$) inside $P^3$.

Theorems & Definitions (66)

• Theorem 1
• proof
• Corollary 1: Uniqueness of optimal solutions
• proof
• Proposition 1: Structure of optimal solutions
• Corollary 2: Simplified coupled system
• proof
• Proposition 2: Higher-order recurrences
• proof
• Proposition 3: Closed-form expressions