Abstract
In [10] a recursive algorithm was proposed for the multipeg Towers of Hanoi problem, a generalization of the standard problem. Based on the observation of the recursive algorithm, a nonrecursive approach is obtained in this paper and many characteristics disclosed to remove the recursion. Among those is the interesting relation between the Towers and the binary representation of nonnegative integers, which greatly helps the establishment of the new approach. In addition, several classes of nonnegative integers with elegant combinatorial properties will be involved in establishing and analysing the new algorithm.
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.
