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.
Index Terms—Natural Algorithm (NA), Towers of Hanoi (TOH), N-Tower Solution.
A. S. Zaforullah Momtaz is with the Department of Computer Science and Engineering, University of Asia Pacific (www.uap-bd.edu), Dhanmondi, Dhaka-1209, Bangladesh.
Md. Fayyaz Khan is with the Department of EEE, United International University, Dhanmondi, Dhaka-1209, Bangladesh.
Muhammad Sajjad Hossain is serving in the Department of Arts and Sciences, Ahsanullah University of Science and Technology, Dhaka-1208,Bangladesh.(E-mail: www.aust.edu)
Aloke Kumar Saha is with the Department of Computer Science and Engineering, University of Asia Pacific (www.uap-bd.edu), Dhanmondi, Dhaka-1209, Bangladesh.(E-mail: aloke@uap-bd.edu).
Kazi Shamsul Arefin is with the Department of Computer Science and Engineering, University of Asia Pacific (www.uap-bd.edu), Dhanmondi, Dhaka-1209, Bangladesh.(E-mail: arefin@uap-bd.edu).
Cite: A. S. Zaforullah Momtaz, Md. Fayyaz Khan, Muhammad Sajjad Hossain, Aloke Kumar Saha and Kazi Shamsul Arefin, "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.
Copyright © 2008-2024. International Journal of Engineering and Technology. All rights reserved.
E-mail: ijet_Editor@126.com