I guess this is Because


If you're given just a⊕b and b⊕c, then you can calculate (a⊕b) ⊕ (b⊕c) = a ⊕ (b ⊕ b) ⊕ c (since ⊕ is associative) = a ⊕ 0 ⊕ c (since X⊕X=0 for any X) = a ⊕ c (since X⊕0=X for any X) so in effect when you're given a⊕b, b⊕c, a⊕c you've only been given two numbers (because the last one is redundant). So (assuming a,b,c are 8 bits as ...


I found a sun destroyer with just 10 cells filled! It takes 39 generations. As animation:


The answer is echo -e 'AAAAHHH!!!\a' > /dev/null # #


The following is a solution with 34 generations: And, yes, it was really fun to play with it :).


Well perhaps


This is not possible. Consider the two cases where a, b and c are all true or all false. Now in both cases we have a⊕b = b⊕c = a⊕c = false And more generally, $(¬a)⊕(¬b)=a⊕b$, so if $a,b,c$ is a solution, then so is $¬a,¬b,¬c$. (from Klaus Draeger)


6 cells, 43 and 50 generations I found 11 unique (up to reflection) 6-cell solutions: By the first generation of evolution, they form two identical groups: The first, fourth, and last two patterns work by the same method as my previous answer, but are three generations (one pulsar period) slower. Except for some self-destructing debris they are the same ...


6 cells, 111 generations I found 12 unique (up to reflection) 6-cell solutions: They all work by the same method as my previous 8-cell solution, forming a house one cell below the top of the base area at generation 6. Here's an animation: There are no solutions with fewer than 6 cells (that stabilize within 200 generations). previous solution: 8 cells, ...


23 cells, 41 generations, humorous answer Sorry, I couldn't resist it... The pulsar dies on "magical command" after 41 generations but it takes 23 initial cells. I apologise for the crudeness of the image. It's my first time using Golly. EDIT: The next challenge is answered under my registered name Ruutsa


I have a solution: I shamelessly stole the upper part from BaSzAt's 8-cell sun destroyer, and, by trial and error, found a 7-cell lower part that generates a new pulsar without interfering with the upper half. Like BaSzAt's solution, it takes 44 steps to gobble up the old sun, although the new one is already fully formed after 32 generations. The center ...


Works in gcc, with 3 characters on the line above: Side note:   To reactivate the printf() add a blank line above it. Another side note:   As learned from an answer to ‘‘Loopy’’ C loop, with 5 characters this approach can really puzzle that nasty boss by using, what else, ??. Gag variation, 1 character total, no new line: (not allowed, ...



Well, he can do it by adding on the line before. So that's Or, slightly better, exploit the fact that and make that first line for


In case anyone is wondering, here is my own solution, which takes 38 generations. (NB: When I made this puzzle, I had no idea if it's even generally solvable. It took me 4 or 5 hours, while having the freedom to change the drawing area as I like.) By the way, the bottom cells are just for decoration. The following works too: As animation:


This looks like because also, X should be ...


Ok, an excellent puzzle like this deserves a complete answer, so I'm going to bring everything together and fill in the missing blanks... First, we have to determine if there's actually a reason to look for Karen and the kids, so: WorldSEnder noticed that in the text there are multiple unicode characters used as substitute for normal letters. If you take ...


The next number in the sequence is: The sequence he is following is:


I made another one, with a mere 8 cells. It takes 44 generations. As animation:


Brace yourself to realise that this puzzle is even cleverer than you first think... This is a special one... The seven-letter answer is: Why? Firstly: Next, notice: To replace the underscores with a seven-letter word, note that: For this reason, I believe the final sentence the OP is looking for is: HOWEVER - HOLD THE PHONE... So far this is little ...


The answer is Following Dan Russell's partial answer: Thanks to @f'' in the comments, the interpretation of this is:


More humorous solutions (destroy methods) Sorry, I couldn't resist too Call 911 :) 20 cells, 38 generations: Use AI (artificial intelligence), 62 generations:


John's new password is: The word keeps in the "money" theme. It is for a bank account (money-themed) and his previous password was BROKE (money-themed). John's actions were as follows: Alternate solution: Alternate alternate solution:


Answer: Explanation: Here are the functions for the output (in Java). Output 1 = !((!C)|C) Output 2 = (!C)|C Output 3 = !((!C)|C) Output 4 = (A|B)&C Output 5 = (!(A^B))&(!(B^C)) Output 6 = ((!A)&(B^C))|((A&C)&(!B)) Output 7 = ((A&C)&(!B))|(!((B|C)|A)) Output 8 = (!(B&C))|A Using these functions


Partial - No time to finish it now As was mentioned by Beastly Gerbil the QR-Code decodes to: This points to a new image: With this image: Next Step:


I like the other answers, but there's a clue that they really don't capture well. This answer is similar to the others, but I think hits some of the clues more accurately than the other answers. You are Little 'bout my age: far from that of B Yet in my syntax, you will find some C The way I treat vars, that is much like D I do take objects, but I'm not ...


Here you can find the files found in the recovered compressed file. The ogg file is distorted, maybe somebody with better audio editing skills can figure out something. The pictures and filenames already tell enough for me though. A shorter wrap-up of all the findings that lead to the result can be read here, but I also kept the original post with updates ...


I think it was and the quote is Explanation for those not familiar with SSH: Explanation for the year:


My guess is: Beacuse:

Only top voted, non community-wiki answers of a minimum length are eligible