consistency + correction
commited
commit
9eaa09cdf3e214a1a0cb438a3752881ade6dfa2e
| ... | ... | @@ -5,24 +5,35 @@ quest: true |
| 5 | 5 | |
| 6 | 6 | [Tower of Hanoi](https://play.fancade.com/5EBB62523C0B03D5) by Spolarium is an adaptation of the math puzzle of the same name. |
| 7 | 7 | |
| 8 | # Gameplay |
|
| 8 | ## Gameplay |
|
| 9 | ||
| 9 | 10 | The gameplay features disks, and 3 pegs. The goals is to get all blocks to the last peg (chequerboarded for convenience) in a pyramid structure from biggest to smallest as fast as possible. Click a peg to dislodge a disk, and click the next peg where you wish to place the disk. Here are the rules: |
| 10 | 11 | * You can only move one disk at a time |
| 11 | 12 | * You take either the only disk on a peg, or the top disk of a stack, and move it onto the top of another stack, or onto an empty peg. |
| 12 | 13 | * You may not place a disk on top of a smaller disk. |
| 13 | 14 | |
| 14 | # Solution |
|
| 15 | The following is an iterative solution. From left to right, we will call the pegs A, B and C.<br> |
|
| 16 | For any n disks, the minimum amount of moves to make to solve the puzzle is (2^n)-1.<br> |
|
| 17 | For an even amount of disks, the following is done:<br> |
|
| 15 | ## Solution |
|
| 16 | ||
| 17 | The following is an iterative solution. From left to right, we will call the pegs A, B and C. |
|
| 18 | ||
| 19 | For any n disks, the minimum amount of moves to make to solve the puzzle is (2^n)-1. |
|
| 20 | ||
| 21 | ---- |
|
| 22 | ||
| 23 | For an even amount of disks, the following is done: |
|
| 24 | ||
| 18 | 25 | * Make a legal move from A to B in any direction. |
| 19 | 26 | * Make a legal move from A to C in any direction. |
| 20 | 27 | * Make a legal move from B to C in any direction. |
| 21 | 28 | |
| 22 | Repeat this until the puzzle is solved.<br><br> |
|
| 23 | For an even amount of disks, the following is done:<br> |
|
| 29 | Repeat this until the puzzle is solved. |
|
| 30 | ||
| 31 | ---- |
|
| 32 | ||
| 33 | For an odd amount of disks, the following is done: |
|
| 34 | ||
| 24 | 35 | * Make a legal move from A to C in any direction. |
| 25 | 36 | * Make a legal move from A to B in any direction. |
| 26 | 37 | * Make a legal move from B to C in any direction. |
| 27 | 38 | |
| 28 | Repeat this until the puzzle is solved.<br><br> |
|
| ... | ... | \ No newline at end of file |
| 0 | Repeat this until the puzzle is solved. |
|
| ... | ... | \ No newline at end of file |