Coursework.Info - Inspiration in an Instant

On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:

Introduction Our course work is called the towers of Hanoi. We were asked to have x number of discs and move them to a different place in the least number of moves possible. There are two other places you can move them to. This is what it looks like with 4 discs. You have to move all of the discs to either B or C, they have to be in the same order. While moving the discs you can not put a bigger disc on top of a smaller one. We are to try with different numbers of discs and see if you can find a rule or a pattern Number of discs and its moves 1 Disc 1. 1-B 2 Discs 2. 1-B 3. 2-C 4. 1-C 3 Discs 1. 1-B 2. 2-C 3. 1-C 4. 3-B 5. 1-A 6. 2-B 7. 1-B 4 Discs 1. 1-B 2. 2-C 3. 1-C 4. 3-B 5. 1-A 6. 2-B 7. 1-B 8. 4-C 9. 1-C 10. 2-A 11. 1-A 12. 3-C 13. 1-B 14. 2-C 15. 1-C 5 Discs 1. 1-B 2. 2-C 3. 1-C 4. 3-B 5. 1-A 6....

Get instant access

• Instant, unlimited access to our documents in full
• Swap your work for free access, or pay £4.99
• To see the full version of this document and 145,982 others

OR

Receive email updates for this category

• Simply tell us your email address and receive a weekly Study Help Email for FREE
• Receive 3 FREE essay views with each email
• Get all the latest essays from Coursework.Info & discussion from TheStudentRoom.co.uk