# LSAT and Law School Admissions Forum

Get expert LSAT preparation and law school admissions advice from PowerScore Test Preparation.

## #7 - Local, Could Be True

• PowerScore Staff
• Posts: 8220
• Joined: Feb 02, 2011
#41278
Complete Question Explanation
(The complete setup for this game can be found here: lsat/viewtopic.php?t=11660)

The correct answer choice is (C)

The last question in a game is often the most difficult, and that general rule holds true here. Let us take a moment to examine why LSAC so often makes the last question difficult. The key to understanding this phenomenon is to look at it from a psychological perspective. As you near the end of a game, your mind naturally begins to focus on quickly finishing the game at hand and preparing for the next game. At just this point, when you want to go more quickly, LSAC throws in a difficult question. This tends to have the effect of slowing you down considerably, and that usually leads to a degree of frustration. Once you become frustrated, your chances of missing the question increase. And when you go to the next game, you may still be thinking about what happened on the last question, and that can contribute to a poor start on the new game, causing further trouble. In a nutshell, do not forget about the importance of psychology on the test. You must remain positive, focused, and calm throughout each section. If you become upset or frustrated, take a moment to relax and regain your equilibrium.

The local condition in the question stem sets up the following relationship:
J96_Game_#1_#7_diagram 1.png (1.83 KiB) Viewed 1116 times
This sequential relationship automatically produces several Not Laws:
J96_Game_#1_#7_diagram 2.png (6.26 KiB) Viewed 1116 times
In addition, the interaction of the last rule and the sequence further establishes that G cannot be inspected on day 3 since it would then be impossible for Q to be inspected on day 5 (in this question if G is inspected on day 3 then R would be inspected on day 5). Also, because of the block produced by the question stem, if G cannot be inspected on day 3, then Q cannot be inspected on day 4 and R cannot be inspected on day 5. Using these inferences and the Not Laws above, we can eliminate answer choices (A), (D), and (E) from consideration. At this point, unless you see what distinguishes answer choice (B) from answer choice (C), the best strategy would probably be to try a quick hypothetical using either answer choice. As it turns out, answer choice (B) is incorrect, since if H is inspected on day 6 the following impossible scenario results:
J96_Game_#1_#7_diagram 3.png (2.82 KiB) Viewed 1116 times
As shown above, G is inspected on day 3, but Q is not inspected on day 5—a violation of the last rule. By process of elimination, answer choice (C) is proven correct.

Some students question whether answer choice (C) can be valid since it leads to a solution (F-J-H-G-Q-R) where Q is inspected on day 5 but G is not inspected on day 3. Remember, the conditional rule only activates if G is inspected on day 3. If Q is inspected on day 5, nothing necessarily happens (to think otherwise would be a Mistaken Reversal).
Stephanie Oswalt
• PowerScore Staff
• Posts: 485
• Joined: Jan 11, 2016
#63902
Hello,

We have received the below question from a student. An instructor will respond shortly. Thank you!
Hello,
I am struggling with the above explanation for question #7*. You do not put F in your diagram and I am unsure how you knew it is supposed to go in slot #1.

Sofie

*admin note- this same explanation also can be found on on page 172 of the LSAT Logic Games Bible 2018 edition
• PowerScore Staff
• Posts: 3876
• Joined: Apr 14, 2011
#63908
In addition to the explanation above, here's a link to the setup for this game, which will help establish some of the baseline parameters:

lsat/viewtopic.php?t=11660

For this question, we have a rather unwieldy block of GQR, which has to be after J somewhere. One approach to this question is described at the top of this thread as a process of elimination, but another way to attack is to identify the few places that big block can go. We know it cannot start at space 1, because J is before it, but let's see what happens if it starts at space 2, forcing J to space 1:

JGQR_ _

Since F must be either 1st or 6th, in this case F must be 6th, and that leaves H, the random variable, to go 5th, for this solution:

JGQRHF

With this in hand, scan the answers to see if any of them match. Remember, this is a Could Be True question, so we only need to find one thing that is possible.

Rats, no matches! Okay, where else can that block go? We cannot start it at 3, as explained earlier in this thread, because that would put Q at 4, but when G is 3rd Q must be 5th. So, let's shift it down one more space, starting the block at the 4th space:

_ _ _ GQR

This now forces F to be 1st, since 6th is occupied, and J and H become interchangeable at 2nd and 3rd, like so:

F J/H H/J GQR

Again, scan the answers, and boom! Answer C is possible! None of the others work.

So, to answer your question, we didn't play around with F in the explanation because there was a solution where it went first and another where it went last. Instead, we focused on eliminating impossible answers to select what was left. Taking this alternate approach is about searching for what can happen rather than eliminating what cannot, and either is a viable option. It's up to you to determine which one is more intuitive for you and best matches your personal style when it comes to games. Try both and see what you like!
Coleman
• Posts: 56
• Joined: Jul 07, 2020
#83758
I understand there are two options to go with F - JGQRHF and FJHGQR.
However, I wonder why HJGQRF or FJGQRH is impossible. In these two scenarios, it is hard to narrow down the answer choice into (C) exclusively since it is "could be true" question.