Abstract
Abstract A generalization to the Towers of Hanoi problem is suggested. In this generalization, n discs of different sizes are arranged initially in one or more towers on three pegs, and the task is to move them to a specified peg under the usual restrictions. A simple recursive algorithm for this generalized Towers of Hanoi problem is presented.
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.
