Q12

[tzyc]

If we put K/T on O I can see why it does not work...
it would be
L T J
S K V
------
M O P

And this will violate rule that L and S cannot go together.
But I'm not sure how to get to the answer in the beginning...
Which constraint should we focus for this kind of (cannot type)question?
Thank you.

[timmydoeslsat]

There are two approaches to always keep in mind.

We can arrive at unacceptable situations in a multitude of ways. We ultimately would like to have prior work eliminate at least a couple of answers here. During your practice with logic games, however, it is even better to practice how to spot these issues without the use of prior work to sharpen your skills.

This question stem is about what pair O cannot have.

You first want to scan the choices for the obvious mutual exlusive rules that end the logic game setup.

You then want to think about how the rules would force problems.

I am sure you have seen in prior game types where this type of situation would arise:

Lets say we have variables A, B, C, D, and E. We must select 2 of 5.

Our only rule is B ---> C
_ _ .... _ _ _

We know we cannot select, for example, A and B, or D and B, etc. If we choose B, we could not have anyone else tag along but C.

In the context of the field trip game, we know that ~M(K) ---> O(V).

So we know that if K were to go into O, we cannot have anything but V go there as well. From now on, you can focus like a laser into a rule like this.

[ganbayou]

Hi Timmy,

Can I ask your thinking process when you solve this question?
I understand your explanation, but during my practice, I could not find it out just by looking through answer choices.
I was wondering, do you check all elements in the answer choices&remember rules or...
Would really appreciate it if you can type out your thinking process to solve this question.

Thanks,

[ManhattanPrepLSAT1]

Hi Ganbayou, here's my thinking on this one...

If you take each answer choice and compare to the frames, you'll see that there is always the possibility to have the pair assigned to O except for answer choice (C).



Another way is to see that you're trying to break a constraint. You cannot break the first constraint because the answer choice is about those who are assigned to O. The constraint says nothing about those assigned to O. But the second constraint does say something about those assigned to O.

So the way to break this rule is to make sure that K is not assigned to M. That will trigger the rule. To make sure of this, let's make sure K is part of the pair assigned to O. Then K will not be assigned to M. And not let's make sure that V is not assigned to O. That will break the rule. So we're looking for any answer choice that has K but does not have V!

Only answer choice (C) has both. If you'd like to see another game where you can practice breaking a constraint like this, check out: PT49, S1, G2, Q10. You can do the same thing and simply break the second constraint of this game to find the correct answer, rather than grind it out.

[ganbayou]

Hi Matt,

Thank you for your reply, just want to double check...
So to break the rule you chose to put K into O instead of P because it asks what O cannot accompany, right? (So force it to O.)
And the way you broke the rule is to trigger sufficient elements without having necessary elements, right?

Thank you.

[ManhattanPrepLSAT1]

Exactly, nice work!