by swwestley Fri Dec 10, 2010 3:39 pm
interestedintacos's guide is near-definitive, however I thought I'd give this a whirl too.
First we must create a representation of the situation.
Before even viewing the rules, we must realize that this game is based on fitting eight items, in various orders, into eight slots.
Rule 1, combined with Rule 5, tells us that M, O, and K cannot be placed next to each other.
Rule 2, combined with rule 5 tells us the same about R, N and L
Rule 3 gives us the sequence M-O-K
Rule 4 gives us the sequence N-P-L
Now, before looking at the questions, we need to realize the following:
We can combine Rules, 1, 5, and 3 to get a relatively restrictive stipulation that could be represented M_?_O_?_K, meaning there must be at least one other group (but possibly more) in between M and O, and O and K.
The next most important rules concern N-P-L and the placement of the R. N's inability to be placed next to L is immaterial because of the the N-P-L sequence
Q has no restrictions.
It would be a reasonable strategy for each of the following questions to begin by dealing with the M_?_O_?_K group, then moving on to N-P-L and R, and leaving the easily disposed of Q to be considered last.
1. For this relatively easy question we can use the "comb" technique, applying rules or deductions one by one until only one answer is left. Naturally, we want to start with our most restrictive deduction, that concerning the M_?_O_?_K group. This immediately allows us to eliminate [C],[D],and [E] as possibilities. Next we look at R. In answer [B], it is placed next to L, violating rules 2 and 5. Thus we eliminate [B] and choose [A].
2. This question about "O" should immediately cause us to focus on the M_?_O_?_K group again. Our prior deductions allows us to see that the earliest O could possibly appear is in the third slot. Thus, [A] is impossible, and our correct answer.
3. This is the first question for which a diagram consisting of our eight slots is useful. Using our previous deductions about the M_?_O_?_K group, we can immediately see that O must fall into the 6th, and K into the eighth slots.
The "Must be true" formulation can be confusing. There are two ways we can proceed. The "brute force" approach would involve attempting to find a counterexample (that is, a complete ordering that follows the rules and yet falsifies the answer) for each answer. The answer which cannot be falsified will be the correct one. While unfailingly accurate, this is potentially quite time consuming.
Therefore, it would be still more appealing to discover an elegant logical solution, and luckily, one is apparent in this case: Without even trying different combinations and simply from applying rule 4, we can see that P could never be in the first or seventh (last of the remaining available) spots. If one of the answers were to express this, we could immediately select it as the winner. Answer [C], "O performs after P", given what we already know, may as well say "P can never be in the seventh place". Thus we can select [C] as our answer.
To describe the second approach in an easily generalizable way: We first found a positive statement (P can never be in the first or seventh place) about the possible ordering and then checked to see if any of the answers matched it.
Choosing to approach the problem in this way represents a calculated risk. While in this case it was much faster than the "brute force" method, it would of course have been possible that none of the answers would have expressed the deduction we made, and we would have been forced to return to the brute force method with an additional time handicap.
4. A diagram will once again be useful in order to make the necessary deductions. In fact, if one diagrams the problem correctly M_O_KNPL, the question practically answers itself. The remaining bands can appear in either place, thus there are two possibilities and our answer is [B].
5. This kind of question can be confusing. Two approaches follow, but they both begin the same way: First, make all possible deductions based on the knowledge that L is third. This gives is NPLM_O_K.
From here, we once again face a choice between a "brute force" negative approach, and a more intuitive, "positive" method.
Using the brute force method would require asking of each potential answer, "Does this information, if applied to the original ruleset, allow me to deduce exactly NPLM_O_K?"
Or to put it negatively, "is there any other possibility than NPLM_O_K given this answer?
A quick glance at the possible answers shows us that [C] cannot possibly be true, as the original knowledge that L is third does not tell us the exact location of R.
[A] can be eliminated, because M could immediately follow N
[B] can be eliminated, because M could immediately follow P
[D] can be eliminated because as we saw in question three, the entire NPL formulation could be after the M_O_K group
Therefore [E] must be correct.
The positive, intuitive approach to this question is more difficult to describe but might happen as follows. The most distinguishing factor of the NPLM_O_K ordering seems to be that the entirety of the NPL sequence is before M_O_K, and additionally, that this is the only possible ordering if that is true. Thus any potential answer that lets us know that NPL comes before M is true will be our solution. [E] fits the bill.
6. Adding R to our much-used M_?_O_?_K group tells us that R must be in one of the first three spaces.
Keeping in mind the that we are now looking for an answer that CAN'T be true, our approach is the following:
Looking at our answers, there is one where [R] appears in the first space, and it is immediately followed by M, which checks out, so we can eliminate [A]
Looking again at the answers, there is one that places R in the second place, preceded by Q. This is also possible, so we can eliminate [E]
All of our remaining possible answers require that R be in the third place. Thus, if any were to contain N or L in the second place, they would be impossible and thus correct. Answer [D] contains N in the second place, and is therefore our correct answer.