LG Game 2 Question 11 Explanation, by LSATHacks
On rule substitution questions, you should think about other rules that affect the variable in question. The rules which affect T are:
- T can’t go first.
- T must be exactly three spaces in front of W.
If we want to replicate the first rule, we’ll have to use W. If we say W can’t go fourth, then that would stop T from going first (since T has to be three spaces in front of W.)
B is CORRECT. Frankly, this was the easiest rule substitution question I’ve seen – they’re usually more elaborate.
D is the trap answer. It’s true that this rule forces T not to be in first. But the question isn’t asking “how do we make T not first”. It’s asking “how do we replicate the rule”. That means leaving all other rules the same. And U normally can go after T, so this answer contradicts the regular rules of the game.
C is a funny answer. It’s actually something which already can’t be true, as we saw in question 10. So it adds nothing.
And further, C doesn’t make anything else happen. I really can’t figure out how A or C could help with the goal of preventing T from being first. They don’t force anything else to be first, or force T to be somewhere else.
E might make you think that X goes before T, and therefore blocks T from going first. But, E is consistent with this scenario: “T X _ W”
Placing X before W doesn’t place X before T! Further, if X were forced before T, that would also be wrong, because in the normal rules X can go after T.
I put C for this answer because It does infer that T cannot be first. If “X” is in the 6th place then “W” could not be in placement 5 or placement 7 (which it needs to be). Meaning “W” would have to go in placement 4 putting “T” in 1 (which it cannot be). We already know that “W” cannot go into 3, 2, or 1 (and 4 for that matter).
Is it possible to get further explanation on this perspective? I feel like I am not right, but I am also not wrong. These are questions that get me.
For Rule Substitution questions, you need to choose an answer choice that will not result in the desired condition IF it is not abided by. Yes, having X in chapter 6 forces T into chapter 1, which results in the desired constraint. However, If X isn’t in chapter 6, then there is nothing to restrain T from being in Chapter 1. We can follow this new rule but break the original rule like such: Ex. T R S W U X Z
On the other hand, if W not being mentioned in chapter 4, combined with Rule 2 will still assure that T is not in chapter 1. This guarantees the same result as the orginal constraints.
Not to mention, in question 10, we debunked that X cannot be in question 10. Logic Games rules exist to restrain the possible sequences, but application of them by themselves will never result in a situation that is impossible.