27-06-2012, 12:23 PM
SEMINAR ON TOWER OF HANOI
TOWER OF HANOI.pptx (Size: 103.26 KB / Downloads: 44)
INTRODUCTION:
Towers of Hanoi (aka Tower of Hanoi) is a mathematical puzzle invented by a French Mathematician Edouard Lucas in 1983
The number of discs can vary, but there are only three towers
The goal is to transfer the discs from one tower another tower.
It is also understood that you can only take the top most disc from any given tower.
EXISTING SYSTEM
At the beginning of the subroutine, code is inserted which declares stacks associated with each formal parameter, each local variable, and the return address for each recursive call. Initially all stacks are empty
The label 1 is attached to the first executable program statement.
Store the values of all parameters and local variables in their respective stacks. The stack pointer is the same for all stacks.
PROPOSED SYSTEM
The Tower of Hanoi is frequently used in psychological research on problem solving.
The Tower of Hanoi is also used as Backup rotation scheme when performing computer data Backups where multiple tapes/media are involved.
A pictorial version of this puzzle is programmed into the emacs editor, accessed by typing M-x hanoi. There is also a sample algorithm written in Prolog.
solution
Move the top N-1 disks from Source to Auxiliary tower,
Move the Nth disk from Source to Destination tower
Move the N-1 disks from Auxiliary tower to Destination tower.
Transfering the top N-1 disks from Source to Auxiliary tower can again be thought as a fresh problem and can be solve in the same manner. So once you master solving Tower of Hanoi with three disks,.
CONCLUSTION
only a humble venture to satisfy the needs in the institution. Several user friendly coding
have also adopted.
The objective of software planning is to provide “Tower of hanoi”.
the software project and should be updated regularly as the project progresses.