| Home | Sign up! | Projects | Seminars | Research Notes | Today's Lecture | About |

Update Seminar Form
 Course: Seminar Topic: Seminar Description: This seminar on "Towers of Hanoi" was given by me along with Atika Shirkot as my partner.Towers of Hanoi is basically a game which has a legend associated with it i.e." How can the hermits shift 64 discs from one peg (source) to the third peg (destination) and the day it is done the earth would come to an end." There are three pegs and the discs have to be moved from the first to the last one which is the destination keeping in mind the two rules that are: 1. not to keep the larger disc on the smaller one and 2.move a disc at a time. We showed how this can be done and the method used was "Recursion" the formula derived in general for n discs is 2^n-1 . For example, the animation below shows the case n=3:

Along with this we showed them that this method is the optimal and proved it through Induction.We had also made an algorithm and program for this.We even showed that how much time the hermits would take to complete this and the process is still going on.This seminar on "Towers of Hanoi" was given by Atika along with me as my partner.Towers of Hanoi is basically a game which has a legend associated with it i.e." How can the hermits somewhere in Hoanoi can shift 64 discs from one peg (source) to the third peg (destination) ." There are three pegs and the discs have to be moved from the first to the last one which is the destination keeping in mind the two rules that are: 1. not to keep the larger disc on the smaller one and move a disc at a time." We showed how this can be done and the method used was "Recursion" the formula derived in general for n discs is 2^n-1 . Along with this we showed them that this method is the optimal and proved it through Induction.We had also made an algorithm and program for this.We even showed that how much time the hermits would take to complete this and the process is still going on.I believe that the it was appreciated by the people and we hope to keep up their expections in our next seminar also that is linked to it "Complexity"This seminar on "Towers of Hanoi" was given by Atika along with me .Towers of Hanoi is basically a game which has a legend associated with it i.e." How can wthe hermits somewhere in Hoanoi can shift 64 discs from one peg (source) to the third peg (destination) ." There are three pegs and the discs have to be moved from the first to the last one which is the destination keeping in mind the two rules that are: 1. not to keep the larger disc on the smaller one and move a disc at a time." We showed how this can be done and the method used was "Recursion" the formula derived in general for n discs is 2^n-1 . Along with this we showed them that this method is the optimal and proved it through Induction.We had also made an algorithm and program for this.We even showed that how much time the hermits would take to complete this and the process is still going on.We enjoyed working on this. I believe that it was appreciated by the people and we hope to keep up to their expections in our next seminar which also that is linked to it, on "Complexity". Your Password: