June 2007 Game 3

June 2013 LSAT, Logic Game #1 (seven manuscripts) Q3

Crowdsourcing the June 2013 LSAT:  June 2013 LSAT Explanation Central | About this project Game #1 is just a simple Putting Things In Order game. Here's my explanation for question #3:

http://youtu.be/7fVDKprqVhM

Please ask questions and/or suggest corrections to anything that seems confusing... we want to make this the best resource we can for LSAT students. We'll have all the June 2013 explanations up as quickly as possible. Thanks for reading. Tell your friends!

--nathan

About me: I'm  the owner of Fox LSAT and FoxTestPrep.com. Please email me at fox.edit@gmail.com, call me at 415-518-0630, Tweet me @nfoxcheck out my books here, and watch 15 hours of free LSAT classes here.

Crowdsourcing the June 2013 LSAT:  June 2013 LSAT Explanation Central | About this project

June 2007 LSAT, Game 3, #12

Onward through Game Three of the June 2007 LSAT. Here's our setup for this Game. Question #12 says "Which one of the following CANNOT be true about Freedom's schedule of voyages?" So the question is telling us that the four incorrect answers could be true. The single, correct answer must be false.

There's really no way to predict this one in advance, because I haven't been given any new information to work with. Instead, I'm just going to tackle the answer choices and see which one seems like it would be a problem.  

A) T in week 6... Wait, what? The second rule says "T will be the destination in week 7," right? And the last rule says "no destination will be scheduled for consecutive weeks," right? Well if those two things are true, then... how can T be the destination in week 6? Uhhhhhhh, well, it can't. I didn't think this question would be this easy, but I'm 99.99% sure this will be our answer.

B) M in week 5... I see no reason why this would be a problem. In reality, I wouldn't even test this since I am so certain that A won't work. But for teaching purposes, what if we started with this?

M G  J  __  M  __  T

Boy, it sure seems like that would work. I wouldn't test this any further.

C) J in week 6... I see no reason why this wouldn't work. As a matter of fact, I already penciled out the beginning of this scenario in the setup. I'm not going to bother testing this.

D) J in week 3... Again, I see no reason why this wouldn't work. Just like C, I already penciled out the beginning of this scenario in the setup. No need to test.

E) G in week 3... I didn't anticipate this in my setup, since I was really focusing on J there. But G doesn't cause problems--remember that G is a necessary precedent for J, but that doesn't mean G can't also go in other spots. I wouldn't actually test this, but for teaching purposes, what if we started with this?

__  __  G  __  G  J  T

I don't see any problem with that. Since A slapped me in the face with its obvious impossibility, and B-E all look possible, I'm very comfortable here. Our answer is A.

Image: Boaz Yiftach / FreeDigitalPhotos.net

June 2007 LSAT, Game 3, #11

In my last post I created a setup for the third Game in the  June 2007 LSAT. I didn't make any huge brilliant inferences, but that's okay... I don't need to crush every game in order to finish four games in 35 minutes. I did crush Game 1, and I did well on Game 2. So if Game 3 ends up taking me a little longer, that's okay. I have plenty of time in the bank. Question 11 is a list question, which will enable me to check to make sure I understand all the rules properly. What I'm going to do here is test all the rules, in order, to eliminate answer choices. After testing all the rules, if I've done it correctly, I should be left with one and only one answer. If I am left with two answers, or if I eliminate all five answers, then that means I don't understand something properly. So I'm going to use this question to my advantage, to doublecheck that I'm on the right track.

(This will be the same technique I used on the first question of Game 2. This is an extremely common type of question... and it's an easy type of question, once you get used to it.)

Rule 1: J can't be fourth. This gets rid of D. I'll never have to look at D again on #11. All other answer choices pass this rule, so I don't have to think about this rule again on #11.

Rule 2:  T must be seventh. This gets rid of E. I'll never have to look at E again on #11. All the other answer choices pass this rule, so I don't have to think about this rule again on #11. I'm already down to just A, B, and C.

Rule 3:  M must go exactly twice, with at least one voyage to G between the two voyages to M. This gets rid of B. Answers A and C both pass this rule, and are the only two answers remaining.

Rule 4:  G must immediately precede every J. This gets rid of C. The only remaining answer is A. But before choosing A as my answer, I'm going to make sure I haven't effed anything up by checking the remaining rule.

Rule 5:  No destination scheduled for consecutive weeks. A doesn't break this rule. A has passed all the rules, and all the other answer choices have been eliminated. So A is our answer. Easy!

June 2007 LSAT, Game 3 Setup

Onward with the most learnable section of the LSAT--the Logic Games. Take a couple deep breaths if this section is currently causing you panic. Everyone can improve on this section. Yes, it's the most frequently tanked section. But it's also the most frequently crushed section. I recently had a student get three questions correct on the Logic Games on her first diagnostic LSAT--and by the end of the 8-week class, the student was scoring perfectly (22 to 24 questions correct). It's simply not possible to improve by 20 points on any other section. It'll take some practice, but the payoff will be huge. We can do this. Also: Don't try to run before you can walk. The earlier games in any section tend to be the easier games. So before you tackle Game 3, you probably want to make sure you understand Game 1 and Game 2.

Questions 11-17 of the  June 2007 LSAT deal with a voyage on a cruise ship. The ship's going to make seven stops, at some combination of four destinations (G, J, M, and T.) Here are the rules:

  • Each destination must be used at least once. (This rule is hidden within the paragraph part of the game, rather than in the indented "rules" section. But it's a rule nonetheless--watch out for this, it's a very common trick.
  • J can't be fourth.
  • T is always seventh.
  • M must be used exactly twice.
  • There must be at least one G in between the two stops at M.
  • G precedes every trip to J.
  • No consecutive stops at any destination.

What's the chink in the armor here? What stop is the hardest to schedule? If you were scheduling the voyages, which destination would worry you the most?

Personally, I'm worried about J. The reason I'm worried about J is that it's mentioned in two rules, and it's a pain in the ass in both of them. It can't be fourth, and it has to always be preceded by G. So there might only be a couple ways to fit J in. Let's see:

J can't be first.  (Because if J was first then G would have to go before that, and there's no spot before the first spot.)

If J went second, then G would have to go first.

If J went third, then G would have to go second.

J can't go fourth, because there's a rule about that.

If J goes fifth, then G would have to go fourth.

If J goes sixth, then G would have to go fifth.

J can't go seventh, because that spot is already taken by T.

So, as it turns out, there are four places for J:  Second, third, fifth, or sixth. Interestingly (and perhaps usefully), the second and fifth spots end up very restricted. It must be true that either the second or the fifth spot (or both) is taken up by either J or G. Look:

G  J  __  __  __  __  T

or

__ G  J  __  __  __  T

or

__  __  __  G  J  __  T

or

__  __  __  __  G  J  T

In each of these scenarios, either the second or the fifth spot is occupied by either G or J. (And note that it's possible to occupy both the second and fifth spot with G/J. But at a minimum, one of these spots has to be G or J.)

I've done this game a million times, and I've never done it exactly this way before. I'm not 100% sure I'm doing it the best possible way. But that's fine! Don't let the perfect be the enemy of the good. It's not possible to always do every game in the exact optimal fashion. Every game is a little bit different. Focus on writing down things you know for sure. Here, I have learned for sure that there are only four spots for J, and that the second or fifth spot (or both) must be taken up by either G or J. I don't know if I'm going to crush this game, but I am confident that I haven't totally effed it up at this point. I don't see any major brilliant inferences remaining, so it feels like it's time to go on to the questions. See you in the next post.