![]() No disk may be placed on top of a smaller disk.Ī to B Explanation − uses recursive function & solves the tower of Hanoi. Tower Of Hanoi Program In C Using Graphics In Word Software Development Community Otherwise, please be thoughtful, detailed and courteous, and adhere to our posting rules. a disk can only be moved if it is the uppermost disk on a stack. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules−Įach move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. Tower Of Hanoi Program In C Using Graphics In Word Code In C The objective of this puzzle is to transfer the entire stack to another rod. ![]() We have to obtain the same stack on the third rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top. ![]() It consists of three rods and a number of disks of different sizes which can slide onto any rod. ![]() The tower of Hanoi is a mathematical puzzle. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |