Abstract
The Tower of Hanoi (TH) withm+3 pegs andn discs is a one hundred years old mathematical puzzle which is now experiencing a remarkable revival in computer science, where it has been discussed e.g. in connection with production scheduling and material handling. It is usually solved by double recursion onm andn. In this paper, a solution with the same length is provided which is recursive inm, but iterative inn, thus leading to a purely iterative algorithm for the four pegs TH, based on the well-known iterative solutions of the classical three pegs TH. These algorithms had turned out to be much more efficient than the recursive ones in studies of performance evaluations and might be of some interest in problems of sorting ordered instructions in a parallel computer. Some mathematical tools are derived or cited from literature in order to prove correctness of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
