The Starman's Math Index
First, we'll alter the previous table just a bit (by changing the order of lines 2 and 3) so you can see more clearly what combinations of YES or NO answers you must base your decisions upon for the next two questions:
|
Six
Possible Combinations
|
X |
Y |
Z |
|||
|
1 |
T |
L |
R |
|||
|
2 |
L |
T |
R |
|||
|
3 |
T |
R |
L |
|||
|
4 |
L |
R |
T |
|||
|
5 |
R |
T |
L |
|||
|
6 |
R |
L |
T |
Since the Randomizer
can answer any question with either Yes or No, you must consider
the yellow "R" blocks as either "N/A"
(not applicable); because you already know who the Randomizer is, or
as being able to give you both a Yes and No answer to any of your
questions. The solution, of course, is to be able to eliminate all the possible
combinations except for the correct one. [I
was just thinking about how such logic diagrams might relate to what programmers
call either top-down or bottom-up programming!]
Still Lost? Or, didn't you even try!? OK, click here for your yet another hint!