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

Update Research Note Form
 Course: Research Note Topic: Research Note Description: According to a legend, in the temple of Hanoi, there lies a brass plate on which are mounted three diamond pin. On the first pin, 6 discs of pure gold are placed with the largest disc placed first and the rest on top of it in decreasing order of size. The priest in the temple more the discs from one pin to another based on the following rules: 1) Only one disc at a time should be moved, specifically the topmost disc from any pin. 2) A larger disc should never be placed on a smaller disc. -The priest believe that once the tower has been transferred to another pin, there will be heaven on earth. Therefore they want to complete in least no. of moves. The following general notations denotes a procedure that will move the top n discs from the first pin START to the final pin FINISH through the temporary pin in TEMP. MOVE ( n, START, TEMP, FINISH ) The following procedure provides a recursive solution for n discs. MOVE ( n, START, TEMP, FINISH ) 1) If n=1, then START-> END Return. 2) Call MOVE ( n-1, START, TEMP, FINISH ) 3) START-> END 4) Call MOVE ( n-1, START, TEMP, FINISH ) 5) Return. This solution can be viewed as the divide & conquer algorithm. Your Password: