AS I look at Gamer's solution, without going into it in depth, and I looking at Charlie's programmed solution for a 10 letter word, Gamer is telling us what we have deduced but ... [and Charlie please feel free to correct] ... there is no exclusive pairing of letters to yield letter 'x' or 'y' to think somewhat algebraically???
I think I just found my answer. If I take P and XOR it with 'y' I might expect X, but if I take K and XOR it with the same 'y" I might expect L.
And I think that in having found my answer, Charlie's answer is only one of a combinatorial list.
To simplify without being pedantically correct, XOR says " One or the other but NOT both".
In logic "+" equates to "or", so if a situation allows me to have one of two possibilities to be true, then the overall outcome must be true.
In an XOR situation, the premise can only be true providing both entities are of an opposite state:
ie 1 + 0 = 1, 1 + 1 = 0 and 0 + 0 = 0
(normally, under Boolean we would expect 1 + 1 = 1 but this is where XOR confounds our thinking)
XOR explains why you can turn on a light at the foot of a stair case and turn it off when you reach the top (electrical circuitry usage).
I can have 1110 + 1111 and get 0001. I might have 1011 + 1010 and I will get 0001. If I choose 111 and 101 I get 010, or 000 and 010 gives 010.
My point is a little like x-y = 1; this is a poor analogy because XOR does not behave in way, but...
.... Gamer does not really care what pair we choose, just let it xor to his chosen letter at that instance.
|
Posted by brianjn
on 2005-10-28 10:34:38 |