# Towers of Hanoi Investigation

Extracts from this document...

Introduction

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. ...read more.

Middle

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. 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 16. 5-B 17. 1-B 18. 2-B 19. 3-A 20. 1-C 21. 2-A 22. ...read more.

Conclusion

2-B 19. 1-A 20. 3-A 21. 1-C 22. 2-A 23. 1-A 24. 4-B 25. 1-B 26. 2-C 27. 1-C 28. 3-B 29. 1-A 30. 2-B 31. 1-B 32. 6-C 33. 1-C 34. 2-A 35. 1-A 36. 3-C 37. 1-B 38. 2-C 39. 1-C 40. 4-A 41. 1-A 42. 2-B 43. 1-B 44. 3-A 45. 1-C 46. 2-A 47. 1-A 48. 5-C 49. 1-B 50. 2-C 51. 1-C 52. 3-B 53. 1-A 54. 2-B 55. 1-B 56. 4-C 57. 1-C 58. 2-A 59. 1-A 60. 3-A 61. 1-B 62. 2-C 63. 1-C Results Table Patterns Noticed Rule N2-1 Prediction Extra things that were noticed Conclusion Justify why it works ...read more.

This student written piece of work is one of many that can be found in our GCSE Beyond Pythagoras section.

## Found what you're looking for?

- Start learning 29% faster today
- 150,000+ documents available
- Just £6.99 a month