Solving towers of Hanoi problem using 2-Consecutive moves Algorithm


  • Osaghae Edgar O* Federal University Lokoja Kogi State, Nigeria
  • Obi Jonathan Chukwuyeni University of Benin, Benin City, Edo State, Nigeria.


Towers of Hanoi, algorithm, recurrence relations, parallel algorithm, complexity


Authors: Osaghae Edgar O. and Obi Jonathan Chukwuyeni

Received:   16 September 2023/Accepted 23 December 2023

The problem of Hanoi is a classical one and getting the optimal solution has posed serious challenges to puzzle researchers over the years. This research paper proposed a novel 2-consecutive move algorithm solution to 3-peg towers of the Hanoi problem, which allows a 2-consecutive moves algorithm that moves 2 disks at once in each move instance of the Hanoi algorithm. There are no 2-consecutive moves for the first and last moves; only one disk is moved for these instances. The main purpose of this research work is to derive a 2-consecutive moves algorithm that can be easily implemented in a suitable programming language, and would substantially reduce the computational time to fully compute the Hanoi solution.   


Download data is not yet available.


Bhaskar K. M. & Shubham V. (2015). Tower of Hanoi-An Iterative Solution For Parallel Computation, International Journal of Research Science and Management, 2, 7, pp. 1-7.

Chetverushkin B., Chechina A., Churbanova N. & Trapeznikova M. (2022). Development of Parallel Algorithms for Intelligent Transportation Systems, Mathematics, 10, 643, pp. 2-18.

Chiemeke S. C. & Osaghae E. O. (2006). The turning points in the solution of n-queens problem using backtracking method, Journal of Nigerian Association of Mathematical Physics, 2, 10, pp. 107-114.

German V. (2012). Annotation of logic programs for independent AND-Parallelism by partial evaluation, Cambridge University Press, pp. 583-600.

Guillaume P. & Jean-Charles R. (2018). Parallel Algorithms for Operations on Multi-Valued Decision Diagram, Association for the Advancement of Artificial Intelligence, 6625-6632.

Hyedeh A., Comfar B. & Abbass N. (2011). On the Solution of the Towers of Hanoi Problem, World Academy of Science, Engineering and Technology, International Journal of Mathematical and Computational Sciences, 5, 1, pp. 59-62.

Hysom D. and Pothen A. (2001). A scalable parallel algorithm for incomplete factor preconditioning, Society for Industrial and Applied Mathematics, 22, 6, pp. 2194-2215.

Ikpotokin F. O., Chiemeke S.C. & Osaghae E.O. (2004a). Alternative Approach to the Optimal Solution of Tower of Hanoi, Journal of Institute of Mathematics and Computer Sciences, 15, 2, pp. 229-244.

Ikpotokin F. O., Chiemeke S. C. & Osaghae E. O. (2004b). Generalized Recursive Optimal Solution for the Multi-Peg Towers of Hanoi, Journal of Institute of Mathematics and Computer Sciences, 15, 2, pp. 297-309.

Israa M. & Abdalameer A. (2018). Designing Parallel Algorithms for Parallel System, Iraqi Journal of Information Technology, 9, 2, pp. 33-47.

Kathavatel S. & Srinath N. K. (2014). Efficiency of parallel algorithms on multi-core systems using OpenMP, International Journal of Advanced Research in Computer and Communication Engineering, 3, 10, pp. 8237-8241.

Leiss E. & Mackey I. (2018). The worst Parallel Hanoi graphs, Theoretical Computer Science, 705, pp. 1-8.

Lu V. M. & Dillon T. S. (1995). Parallelism for Multipeg Towers of Hanoi, Mathematical Computational Modelling, 21, 3, pp. 3-17.

Lu V. M. & Dillon T. S. (1994). A note on parallelism for the towers of Hanoi, Mathematical Computational Modelling, 20, 3, pp. 1-6.

Majumdar A. A. K. & Islam S. M. S. (2020). On the Sinner’s Tower of Hanoi, Journal of Science and Technology, 18, pp. 85-92.

Meng Q., Ke G., Wang T., Chen W., Ye, Q., Ma Z. & Liu T (2016). A communication efficient parallell algorithm for decision tree,. 30th Conference on Neural Information Processing Systems, Barcelona, Spain, 2016.

Miller J., Trümper L., Terboven C. & Müller M. S. (2021). A Theoretical Model for Global Optimization of Parallel Algorithms, Mathematics, 9, pp. 2-14.

Obandan S. & Obahiagon K (2015). Rule based expert system approach towards the resolution of the tower of hanoi, Journal of Resourcefulness and Distinction, 10, pp. 6-18.

Osaghae E. O. (2021). Solution to n-Queens Problem: Heuristic Approach, Transactions On Machine Learning and Artificial Intelligence, 9, 2, pp. 26-35

Osaghae E. O., Akanmu A. A. G. & Akhahowa A. E. (2007). Solution to A NON-STANDARD INITIAL STATE of The Tower of Hanoi Problem, International Journal of Physical Sciences, 2, 1, pp. 53-61.

Wu J. S. & Chen J. R. (1992), The towers of Hanoi problem with parallel moves, Information Processing Letters, 44, pp. 241-243.