Towers of Hanoi: Difference between revisions
Mr. MacKenty (talk | contribs) |
Mr. MacKenty (talk | contribs) |
||
| Line 17: | Line 17: | ||
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: | The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: | ||
Only one disk can be moved at a time. | # Only one disk can be moved at a time. | ||
Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. | # Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. | ||
No larger disk may be placed on top of a smaller disk. | # No larger disk may be placed on top of a smaller disk. | ||
With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.<ref>https://en.wikipedia.org/wiki/Tower_of_Hanoi</ref> | # With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.<ref>https://en.wikipedia.org/wiki/Tower_of_Hanoi</ref> | ||
== How you will be assessed == | == How you will be assessed == | ||
Latest revision as of 10:22, 19 February 2020
This is a problem set. Some of these are easy, others are far more difficult. The purpose of these problems sets are:
- to build your skill applying computational thinking to a problem
- to assess your knowledge and skills of different programming practices
What is this problem set trying to do[edit]
We are learning about recursion and thinking through a very complex problem
The Problem[edit]
The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
- Only one disk can be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
- No larger disk may be placed on top of a smaller disk.
- With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.[2]
How you will be assessed[edit]
Your solution will be graded using the following axis:
Scope
- To what extent does your code implement the features required by our specification?
- To what extent is there evidence of effort?
Correctness
- To what extent did your code meet specifications?
- To what extent did your code meet unit tests?
- To what extent is your code free of bugs?
Design
- To what extent is your code written well (i.e. clearly, efficiently, elegantly, and/or logically)?
- To what extent is your code eliminating repetition?
- To what extent is your code using functions appropriately?
Style
- To what extent is your code readable?
- To what extent is your code commented?
- To what extent are your variables well named?
- To what extent do you adhere to style guide?
References[edit]
A possible solution[edit]
Click the expand link to see one possible solution, but NOT before you have tried and failed!
not yet!