by 
sriram
ANSWERS: 1
-
The classic "Tower of Hanoi" problem is how to transfer a stack of discs of increasing diameter from pole 1 to pole 3 in a 3-pole set, without ever placing a disc of a larger diameter on top of a disc of a smaller diameter. This can be solved for any number of discs. Of course, the more discs = the more steps to solve. Here's a simple example: Let's call the discs on the first pole A, B, and C, in increasing diameter. The end solution is to have discs A, B, C (in that order from top to bottom) on pole three. First move: Move disc A to pole 3. Second move: Move disc B to pole 2. You cannot move it to pole three since that would place disc B on top of disc A, and disc B has a larger diameter. Third move: Move disc A to pole 2 on top of disc B. Fourth move: Move disc C to pole 3. (Fine since there are no discs there any more) Fifth move: Move disc A to pole 1. (Fine since there are no discs there any more) Sixth: Move disc B to pole 3. Seventh: Move disc A to pole 3 and you are done. If it helps, try this out with a dime, nickel and quarter to see the moves more visually. Good luck!
RELATED QUESTIONS
Copyright 2023, Wired Ivy, LLC