Abstract
We propose another simple Towers of Hanoi variant, a hybrid between classical Hanoi and linear Hanoi, in which the rules governing movement depend on ring color. An optimal algorithm is presented. The problem and its heavily recursive solution are not difficult; perhaps one of its more interesting facets is that the optimality proof uses simultaneous induction on four statements. This paper can be viewed as similar in purpose and spirit to the author's previous work [1]; the goal here is again to present a fun example of potential usefulness in teaching discrete mathematics and data structures courses.
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.
