Abstract
Abstract In the colour Towers of Hanoi problem, three pegs are arranged as a circle and n black and white discs are stacked on a peg in increasing sizes with the largest disc at the bottom. The objective is to move these n discs to a specified peg subject to the restrictions of the standard problem; in addition, white and black discs may move clockwise and counterclockwise respectively only. A simple iterative solution to this complex problem is presented. The necessary and sufficient conditions which uniquely define the sequences of disc moves are also discussed.
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.
