TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Investigating the structural properties of the Tower of Hanoi problem, using combinatorial approaches

, * , , , ,

* Corresponding author · click or hover a name for details

pp. 469–477Vol. 29Issue 2-AFebruary 2026DOI: 10.47974/JDMSC-2479 Crossmark XML
Received:
09 Apr 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2479
Pages:
469–477

Abstract

Mathematicians and computer scientists have long been interested in the Tower of Hanoi issue due of its many fascinating possibilities. This combinatorial research examines the Tower of Hanoi problem’s structural aspects to determine its behaviour, how solutions vary over time, and the best strategies. By observing how the problem repeats, we identify combinatorial patterns that reveal the minimum number of operations required to solve the puzzle for n discs. We also examine how Stirling numbers, sequences, and binary timber relate to the problem’s solution area. Combinatorial counting rules are used in our method to estimate problem complexity. Combinatorial approaches may help solve other iterative or high-quality flow issues as well as the Tower of Hanoi. The research illuminates combinatorial problem-solving strategies and their applications in computer theory.

Keywords

Subject Classifications

03E05

References

[1] C.-J. Liang, V. R. Kamat, and C. C. Menassa, “Teaching robots to perform quasi-repetitive construction tasks through human demonstration,” Automation in Construction, vol. 120, pp. 103370 (2020).
[2] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1295–1305 (2024).
[3] Z. Abuwarda and T. Hegazy, “Work-package planning and schedule optimization for projects with evolving constraints,” Journal of Computing in Civil Engineering, vol. 30, pp. 04016022 (2016).
[4] T. Kim, Y.-w. Kim, and H. Cho, “Dynamic production scheduling model under due date uncertainty in precast concrete construction,” Journal of Cleaner Production, vol. 257, pp. 120527 (2020).
[5] M. Suszyński and K. Peta, “Assembly sequence planning using artificial neural networks for mechanical parts based on selected criteria,” Applied Sciences, vol. 11, pp. 10414 (2021).
[6] S. Mitrović, D. Andreoletti, and O. Ayoub, “ChatGPT or human? Detect and explain. Explaining decisions of machine learning model for detecting short ChatGPT-generated text,” arXiv preprint, arXiv:2301. 13852 (2023).
[7] C. A. Cardno, “Robotic rebar-tying system uses artificial intelligence,” Civil Engineering Magazine Archive, vol. 88, pp. 38–39 (2018).
[8] A. A. Apolinarska, M. Pacher, H. Li, N. Cote, R. Pastrana, F. Gramazio, and M. Kohler, “Robotic assembly of timber joints using reinforcement learning,” Automation in Construction, vol. 125, pp. 103569 (2021).
[9] A. E. Oke, J. O. Atofarati, and S. F. Bello, “Awareness of 3D printing for sustainable construction in an emerging economy,” Construction Economics and Building, vol. 22, pp. 52–68 (2022).
[10] Y. Gao, J. Meng, J. Shu, and Y. Liu, “BIM-based task and motion planning prototype for robotic assembly of COVID-19 hospitalisation light weight structures,” Automation in Construction, vol. 140, pp. 104370 (2022).
[11] Y. Ding, R. Dwivedi, and R. Kovacevic, “Process planning for 8-axis robotized laser-based direct metal deposition system: A case on building revolved part,” Robotics and Computer-Integrated Manufacturing, vol. 44, pp. 67–76 (2017).

Views: 54Downloads: 10Citations: 0