Tower of Hanoi Chedi - Wooden Brain Teaser Puzzle

Tower of Hanoi Chedi - Wooden Brain Teaser Puzzle

$20.95$20.95
Free shipping
Pickup not available
Pickup not available
Sold & shipped byBrilliant Store
Shop now
<p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;">The&nbsp;Tower of Hanoi&nbsp;(also known as the&nbsp;Tower of Brahma&nbsp;or&nbsp;Lucas' Tower) is a mathematical game or puzzle. It consists of three rods, and a number of disks (most common are 7 and 9 disks) of different sizes which can slide onto any rod.</span></p> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;"><br /></span></p> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;"></span></p> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri; font-weight: bold; text-decoration-line: underline;">Rules</span></p> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;">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.</span></p> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;">The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:</span></p> <div style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0.25in; text-indent: -0.25in; direction: ltr; unicode-bidi: embed; word-break: normal;"> <span style="font-size: 11pt;">1.</span> <span style="font-size: 11pt; font-family: Calibri;">Only one disk can be moved at a time.</span> </div> <div style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0.25in; text-indent: -0.25in; direction: ltr; unicode-bidi: embed; word-break: normal;"> <span style="font-size: 11pt;">2.</span> <span style="font-size: 11pt; font-family: Calibri;">Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.</span> </div> <div style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0.25in; text-indent: -0.25in; direction: ltr; unicode-bidi: embed; word-break: normal;"> <span style="font-size: 11pt;">3.</span> <span style="font-size: 11pt; font-family: Calibri;">No disk may be placed on top of a smaller disk (smaller disks must always be on the top)</span> </div> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;"></span></p> <p style="margin-top: 0pt; margin-bottom: 0pt; margin-left: 0in; direction: ltr; unicode-bidi: embed; word-break: normal;"><span style="font-size: 11pt; font-family: Calibri;">With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2</span><span style="font-size: 11pt; font-family: Calibri; font-style: italic; vertical-align: super;">n</span><span style="font-size: 11pt; font-family: Calibri;">&nbsp;– 1, where&nbsp;</span><span style="font-size: 11pt; font-family: Calibri; font-style: italic;">n</span><span style="font-size: 11pt; font-family: Calibri;">&nbsp;is the number of disks.</span></p>

About This Item

The Tower of Hanoi (also known as the Tower of Brahma or Lucas' Tower) is a mathematical game or puzzle. It consists of three rods, and a number of disks (most common are 7 and 9 disks) of different sizes which can slide onto any rod. 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. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1.Only one disk can be moved at a time.2.Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.3.No disk may be placed on top of a smaller disk (smaller disks must always be on the top) With three disks, the puzzle can be solved in seven moves. The minimum number of moves required to solve a Tower of Hanoi puzzle is 2n 1, where n is the number of disks. Used often in math class
Customer Reviews
0 Reviews
Be the first to review this item!
Questions & Answers0 question
Get specific details about this product from customers who own it.

Policies & Plans

See any care plans, options and policies that may be associated with this product.
Electrode, Comp-283796742, DC-prod-dfw5, ENV-prod-a, PROF-PROD, VER-26.11.3-rc-10, SHA-1872f9ab3058dd9cd190d4aee3ae124f19901bff, CID-