- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This article studies the Tower of Hanoi task. The author analyzes the periodicity and parity structure of the optimal solution and proposes a hybrid architecture that combines RoPE with LSTM in a Transformer. Experiments demonstrate significant generalization capabilities to larger-scale tasks.
Critical strengths
The experimental results are very outstanding. The model achieved strong generalization on tasks far beyond the training range.
Critical weaknesses
The tasks and methods are highly specialized, lacking experimentation on other tasks. It is difficult to derive general insights from the article.
The task is simple. The core principles proven in Theorem 1 and Theorem 2 of this paper are classic properties that have already been well studied.
Questions for authors
See Weaknesses.
We thank the reviewer for the assessment and for recognizing the strong empirical generalization results. We appreciate the concerns regarding the limited task diversity and the novelty of the structural analysis. We would like to clarify the intended contributions of our work and present additional experimental evidence.
W1. Generalizability Beyond Classical Tower of Hanoi
We agree that experiments on classical three-peg Hanoi alone cannot establish generalization to arbitrary recursive planning problems. In this work, our goal is to investigate how architectural inductive biases affect recursive OOD generalization using a controlled, analytically tractable testbed, where the optimal policy and recursive dependencies can be characterized exactly.
To further examine the generality of our findings, we conducted additional experiments on Cyclic Tower of Hanoi, where disk movements are restricted to the directed cycle 0→1→2→0. Unlike classical Hanoi, this variant involves two mutually recursive transfer procedures, resulting in a different recursive program (see our detailed response to Reviewer ANjp).
The results demonstrate that our hierarchy-aware architecture remains effective under this different recursive structure. At N=100, Hybrid (RoPE) achieves 100% sampled one-step accuracy, while Hybrid (APE) achieves 99.90%. Moreover, a reverse-order LSTM alone achieves 100% accuracy, whereas a forward-order LSTM achieves only 32.31%, despite identical model capacity and training configurations.
These findings support our central design principle: identify the recursive structure of a task and align the architecture's computation with it. We acknowledge that Cyclic Hanoi remains within the same puzzle family, and our results do not establish universal generalization. Rather, they illustrate how structure-aligned computation can improve OOD extrapolation across distinct recursive programs and potentially inform the design of neural solvers for other recursive tasks.
W2. Novelty of the Structural Analysis
We agree that several mathematical properties underlying Theorems 1 and 2 have classical precedents. In particular, the parity-dependent cyclic motion of the smallest disk, the cyclic orientation of individual disks, and the alternating move structure have been studied in the literature on iterative Hanoi algorithms, including:
Peter Buneman and Leon Levy (1980). “The Towers of Hanoi Problem.” Information Processing Letters, 10(4–5), 243–244. https://doi.org/10.1016/0020-0190(80)90150-7
Roland Backhouse and Maarten Fokkinga (2001). “The Associativity of Equivalence and the Towers of Hanoi Problem.” Information Processing Letters, 77(2–4), 71–76. https://doi.org/10.1016/S0020-0190(00)00205-2
Andreas M. Hinz, Sandi Klavžar, Uroš Milutinović, and Ciril Petr (2013). The Tower of Hanoi – Myths and Maths. Birkhäuser Basel, 1st edition, 335 pages. https://doi.org/10.1007/978-3-0348-0237-6
We appreciate the opportunity to clarify that our primary theoretical contribution is not the discovery of previously unknown mathematical properties of Hanoi. Rather, we provide a self-contained structural characterization and use these properties to motivate and evaluate neural architectures for recursive OOD generalization.
Specifically, the structural analysis informs two architectural design principles: (i) relative position-dependent interactions across disk levels, motivating RoPE, and (ii) sequential computation aligned with recursive dependencies, motivating hierarchy-aware recurrence.
We additionally exploit the uniqueness of the legal non-smallest-disk move to construct a compact neural policy-learning interface based on predicting the next position of disk 0. While the underlying combinatorial observation is classical, its use as a three-class neural prediction interface allows us to separate policy learning from legal action reconstruction and systematically compare architectural extrapolation behavior.
Importantly, the central contribution of our work is empirical and methodological: we investigate which architectural and training choices support extrapolation far beyond the training regime and how these choices interact with the underlying recursive structure. Our additional experiments further reinforce this contribution. Hybrid (RoPE) achieves 100% sampled one-step accuracy on arbitrary valid configurations at N=128 and N=256, and retains 99.80% accuracy at N=2048, despite being trained only on N=3–10. These results substantially extend the original evaluation and demonstrate the strength of the observed extrapolation within the controlled setting.
We will revise the manuscript to more explicitly acknowledge the classical mathematical foundations, incorporate the relevant references, and distinguish established structural properties from our architectural and empirical contributions.
Thank you again for your constructive feedback.