NOTE: This document attempts to be generic to the entire range of pctX projects. Please substitute the particular number in place of X. For example, if working on pct1, for all references of pctX, use pct1 instead.
From a lab46 prompt, change to the unix public directory, which is in /var/public/fall2019/unix/:
lab46:~$ cd /var/public/fall2019/unix lab46:/var/public/fall2019/unix$
Next, change into the directory of the pertinent pctX project:
lab46:/var/public/fall2019/unix$ cd pctX lab46:/var/public/fall2019/unix/pctX$
Run ls, you should see a list of directories named after the users in the class. Your username should be among them. Change into that directory:
lab46:/var/public/fall2019/unix/pctX$ cd username lab46:/var/public/fall2019/unix/pctX/username$
Run ls again, you should see a file named puzzle. Display this using the cat command (which we are using as a text viewer):
lab46:/var/public/fall2019/unix/pctX/username$ cat puzzle
First, log into lab46.
Again, where 'X' is the number of the current pct project:
lab46:~$ mkdir -p src/unix/pctX lab46:~$
lab46:~$ cd src/unix/pctX lab46:~/src/unix/pctX$
Let us assume your puzzle key is
0 R
1 B
2 V
3 G
4 P
5 M
6 O
7 L
8 J
9 K
You could use nano:
lab46:~/src/unix/pctX$ nano pctX.puzzle.key *and type in RBVGPMOLJK, hit ENTER once, and save/exit*
Once again, using nano:
lab46:~/src/unix/pctX$ nano pctX.puzzle.solution
Once you are completed with the puzzle, have the key recorded, and the solution documented, you can submit the project from this same directory:
lab46:~/src/unix/pctX$ submit unix pctX pctX.puzzle.key pctX.puzzle.solution
Finding and isolating patterns amongst the operations taking place can make available to us additional paths of pursuit for solving the puzzles.
Now, we know that if the top number is greater than ONE of the values being subtracted from it, does it also reveal anything else?
X -Y == Z
Let's say we have, from elsewhere in the puzzle, determined that Z « X, but as yet we have not established any connection between Y and X.
Can we use this to our advantage?
Yes. Take a look at these examples:
4 4 5 9 7 -3 -1 -3 -2 -3 == == == == == 1 3 2 7 4
As we can see here, in the small sample size of subtractions we've tried, that when the top number is greater than one of the numbers beneath it, BOTH values beneath it are less than the top number.
Now, from this approach we cannot make any determinations about how the two lower numbers relate to each other, but we can use it to fill in some gaps.
So, if we know that Z « X, we can ALSO infer that Y « X (we just don't know how Y relates to Z).
So unless we can find an example that violates this case, we can run with it as a viable approach to take in the letter division puzzles. Tell me: is there a valid combination that violates this?
Like the above, but inverted: what if we KNOW that the top number is less than one of the two numbers beneath it? Can we also infer some pattern? Let's see:
X -Y == Z
Let's say that we KNOW, from elsewhere in the puzzle, that X « Y. Can we use that to inform us better on how X relates to Z?
Looking at some examples:
10 11 12 13 14 -6 -9 -7 -4 -8 == == == == == 4 2 5 9 6
As we can see in the examples above, if X is less than Y, X ends up ALSO being less than Z.
So unless we can find an example that violates this case, we can run with it as a viable approach to take in the letter division puzzles. Tell me: is there a valid combination that violates this?
Remember: we are dealing with single digit values (with the exception of the top number needing to borrow), so the viable possibilities are limited.
Absolutely! My letter division puzzle database can be found here:
Do note, that I have done a few example writeups, which may offer some further insight into strategies used, along with examples of what I am looking for as far as documentation for your solutions.