Logged out
Access All our Essays in an Instant
Swap your work for FREE access, or pay £4.99 for instant access
The Towers of Hanoi.
Member rating:
(3 votes)
| Words:
| Submitted: Tue Sep 23 2003
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:
The Towers of Hanoi The Towers of Hanoi is a mathematical game. It consists of 3 poles in alphabetical order and 3-7 discs numbered in size order. At the beginning of the game all the discs are on pole A in size order. The object of the game is to transfer the entire amount of discs from pole A to pole B or pole C in the minimum amount of moves possible. These are the rules of the towers of Hanoi: * A disc must never be placed on top of a smaller disc than its self. * Only one disc may move at a time. * The discs must be on a pole at all times except for one moving Discs Moves 3 7 4 15 5 31 6 63 7 127 By looking at the table it is clear there is a pattern. Every move that is made doubles the last number of moves and adds one. The algebra equation: 2x+1. (Where x is the previous...
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,871 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
