Logged out
Access All our Essays in an Instant
Swap your work for FREE access, or pay £4.99 for instant access
Towers of Hanoi
Member rating: No Rating | Words: | Submitted: Thu Jul 11 2002
Page Preview
On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:
Towers of Hanoi I am going to investigate the Hanoi Towers. The objective of the game is to move the discs from position A to positions B or C in the minimum number of moves where in one go you are only allowed to move one disc. I will vary the number of discs and record my results. I will make predictions and look for patterns. I will ultimately aim to find a formula for the number of moves it takes to move the tower from A to B or C. Suppose you just had one disk. Then the method for moving that one disk from the starting spindle to the ending spindle is simple: just move it. It takes one step : Now suppose you had two disks. The obvious answer this time is to move the top disk "out of the way" to the third spindle, then move the bottom...
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 146,192 others
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
