doi: 10.7763/IJET.2011.V3.248
Design and Implementation of an Efficient Natural Algorithm to Solve Towers of Hanoi Puzzle having Multiple Towers & Disks
- 1 Department of Computer Science and Engineering, University of Asia Pacific, Bangladesh
- 2 Department of Electrical and Electronic Engineering, United International University, Bangladesh
- 3 Department of Arts and Sciences, Ahsanullah University of Science and Technology, Bangladesh
Abstract
Many algorithms are available to solve the puzzle. Natural Algorithm (NA) developed and presented in this paper not only provides solution for the three tower and eight disks problem, but provides solution for multiple towers and multiple disks problem through minimum number of operations. Solution for sixteen towers and fifteen disks has been shown in the paper requiring minimum number of operations.
Keywords
- Natural Algorithm (NA)
- Towers of Hanoi (TOH)
- N-Tower Solution
How to Cite
A. S. Zaforullah Momtaz, Aloke Kumar Saha, Kazi Shamsul Arefin, Md. Fayyaz Khan, and Muhammad Sajjad Hossain, "Design and Implementation of an Efficient Natural Algorithm to Solve Towers of Hanoi Puzzle having Multiple Towers & Disks," International Journal of Engineering and Technology, vol. 3, no. 4, pp. 334-337, 2011. https://doi.org/ 10.7763/IJET.2011.V3.248
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).