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 is an ancient mathematical game. The aim of this coursework is to try to identify patterns and rules associated with the game and explain them in mathematical terms.
Member rating: No Rating | Words: | Submitted: Fri Feb 20 2004
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:
Maths Coursework Robert Allen Queen Elizabeth Grammar School The Towers of Hanoi The Towers of Hanoi is an ancient mathematical game. The aim of this coursework is to try to identify patterns and rules associated with the game and explain them in mathematical terms. The definitions and rules are: Rules: * There are only three positions a disc can be placed. Poles A, B or C. * A disc can only go on top of a larger one. (I.e. Disc A can only go on top of Discs B and C, but Disc B cannot go on top of disc A) * The object of the game is to get all the discs to move from pole A to pole B of C in the least number of moves. * Only one disc may be moved at a time. Finding Formula A Number Of Discs Least Number Of Moves Previous term (Doubled) 1 1 2 3 2 3 7 6 4 15 14 5 31 30 6 63 62 7 127 126 8 255 254 From looking at the table it is quite clear that there is...
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,186 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
