![]() The objective of the puzzle is to move the entire stack to the last rod, 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 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 |