![]() ![]() The minimal number of moves required to solve a Tower of Hanoi puzzle is 2 n − 1, where n is the number of disks. With three disks, the puzzle can be solved in seven moves. No disk may be placed on top of a disk that is smaller than it. ![]() Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules: The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle ) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. A model set of the Tower of Hanoi (with 8 disks) An animated solution of the Tower of Hanoi puzzle for T(4, 3) Tower of Hanoi interactive display at Mexico City's Universum Museum Algodoo solving the hanoi tower For the Vietnamese skyscraper, see Keangnam Hanoi Landmark Tower. This article is about the mathematical disk game. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |