Abstract
This paper analyzes the generalised cyclic Towers of Hanoi problem. A directed state-space graph is used for representing states of discs and disc movements. Such a graph is then transformed to a shortest-path tree for making explicit all shortest paths for moving all discs in all possible states to a goal state. The best-case, the worst-case, and the average-case complexities are then given based on such a shortest-path tree.
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.
