![]() A disk can only be moved if it is the uppermost disk on a stack.Ĭ Programs: String Operations Without using Library Function. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e.The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. Tower of hanoi It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The Tower of Hanoi (also called the Tower of Brahma or Lucas’ Tower, and sometimes pluralized) is a mathematical game or puzzle. ![]() What is Tower of Hanoi? All must be well aware of the problem of Tower of Hanoi, for those who don’t know, let’s discuss it once again.
0 Comments
Leave a Reply. |