Solve this exclusively rare enigmatic-puzzle.
$\begingroup$
$\endgroup$
0
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
11
The way to solve this puzzle is to...
perform an x-or (exclusive-or, hence the title) operation on all three images in a row, in order to preserve only the line segments that, effectively, appear an odd number of times.
If we do this, we can read a message:
Here, the segments being removed are highlighted, leaving only the parts that ultimately spell out words (seen in green). The confirmatory message says WELL DONE.
-
2$\begingroup$ It said the answer was a word hence the tag! $\endgroup$– PDTCommented Feb 1 at 8:41
-
2
-
2$\begingroup$ It seems too convincing a find to ignore such a conclusion. We will see what the op says. $\endgroup$– PDTCommented Feb 1 at 8:44
-
2
-
3$\begingroup$ @SnySmartie Well, it does already say that in the short stub and the first line of the longer description, so I think it's sufficiently indicated as it stands. Consider it just a right of passage to make that error - it happens to all! :) $\endgroup$– StivCommented Feb 1 at 9:03