The Towers of Hanoi Problem in Graph Form. Finding bounds for the number of moves. Presented by: Shibo Fang 9 July 2010 Mentor: Dr. Ernst Leiss. Background. Towers of Hanoi: a classic problem Three poles to move disks on Goal is to move all disks to third pole
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Finding bounds for the number of moves
Thank you. Any questions?