#22 - Local, Could Be True

[Dave Killoran]

Complete Question Explanation
(The complete setup for this game can be found here: lsat/viewtopic.php?t=867)

The correct answer choice is (C).

Because J wins all of his matches, he must end up as player 1. This eliminates answer choices (A), (B), and (D).

Here is the hypothetical that proves answer choice (C) correct:

G4-Q22-d1.png

[iafolayan]

Hi!
I was hoping to get some help on question 22 on section 1 of the 1995 Sept. LSAT. I struggled a lot with this problem mostly because I was caught off guard with it and had no idea where to start and how to set things up. I eventually came up with this:

RJSML5
eoe
or
oeo

R J S M L
1 2 3 4 5

Even (1 is out)
3 v 2
5 v 4

Odd (5 is out)
2 v 1
4 v 3
-------------------------
What is the best way to approach this game? Since there are so many possible outcomes would it be helpful to make a few hypotheticals up front? Also what is the best way to approach question 22. I tried a few hypotheticals but I couldn’t get M to remain in the 4th position. I’m sure if I keep going I’ll eventually get it but in order to save time, is there a systematic way to approach a question like this? And the game in general? I’ve already watched the lesson 7 modules but they were so different from this game and I’m having trouble applying all of the concepts.
Any help would be very much appreciated! Thanks!
-Ife

[Dave Killoran]

As with most Pattern games, this game has a minimal setup.

The first rule indicates that there odd and even rounds. The second and third rules indicate what each round consists of from a matchup standpoint. The fourth rule indicates what happens when a lower-positioned team wins (they move up a spot), and the losing team then drops down. If the lower-positioned team loses, the two teams stay in the same positions.

One of the critical inferences of the game is that one team does not participate in each round. For example, during an odd-position round, the team in position 1 does not play; during an even-position round, the team in position 5 does not play. Also, it is critical to understand that players can only move up or down a maximum of one position from one round to the next. This information is particularly helpful on questions #19 and #24.

Because this is a Pattern game, no further inferences can be made, and you should move on from the setup quickly and get to the questions. Use the questions to get a better understanding of how the game works.

As is the case in many Pattern games, all of the questions are Local. This occurs because the very nature of Pattern games requires that more information be added before any specific inferences can be made.

In #22, because J wins all of his matches, he must end up as player 1. This eliminates answer choices (A), (B), and (D). Thereafter, use a hypothetical to determine whether (C) or (E) is correct.

Please let me know if that helps. Thanks!

[salsaden]

Hi I have been working through this problem and I have been having difficulty understanding and setting up the problem. IT seems like there are more possibilities than I could possibly diagram. In addition, I have absolutely no idea how to approach question 22. I feel I am missing a key inference about this game?

[Dave Killoran]

Hey Salsaden,

Thanks for the question!

Note that this is a Local question with some very specific and restricting conditions. Thus, unlike question #21, we may be required at some point to make a hypothetical that fits the conditions in the question stem at some point. Still, however, the pattern in the game has a major effect if you consider it prior to examining each answer: Because J wins all of his matches, he must end up as player 1. This eliminates answer choices (A), (B), and (D), and makes the question considerably easier. At this point, you can either use the pattern to eliminate (E) (because S ends up in position 5 regardless of whether an even or odd round is first) or show the hypothetical that proves (C) is possible.


Please let me know if that helps. Thanks!

[salsaden]

Thank you, this helps a lot, I ran into trouble with this one bc I did not identify it as a pattern game until afterwards but it is easier to deal with once I understood the pattern better.

[Sara Gold]

Hi,
Sorry if this is a stupid question. What do you mean by using a hypothetical to determine whether it is C or E? What would you do exactly?

Thanks,
Sara

[Jon Denning]

Hey Sara,

Thanks for the follow up, and it's not a stupid question at all!

What Dave means is that once you've narrowed it down to (C) and (E), and you know that only one of them "can be true" according to this question, simply attempt to create a scenario where one of them occurs. So if we try to create (C) and put L in 2, then it'll either be possible and (C) is correct, or we'll encounter some problem with L in 2 and (E) will then be correct by default.

So let's try to follow the local rules of this question (after three rounds, M is in 4 and J and L have won all their matches) and end up with L in position 2. To do that, let's take it round by round:

From left-to-right as positions 1-5, after round 1 we'd have: R J S L M (remember, J and L both win, so J stays in 2 and L moves up to 4)

After round 2: J R L S M (J and L would both move up here)

And after round 3: J L R M S (we need to get M back to 4 with a win, and L moves up another spot to 2)

So there's L in 2, which is what (C) states. Note too that (E) can't happen since S loses to L and then M getting pushed down to the 5th position.


Creating quick hypotheticals can be a big help when you've got it down to two answers (or are trying to test a possibility), so keep it in mind as you continue preparing! I hope that helps!

[Sara Gold]

Hi,
Yes! It definitely clears things up.
Thank you!
Sara

[vedan22]

Hi - can you explain why you began with an odd round in the hypothetical you outlined above? If I were to try a hypothetical in a pattern game, how would I know which rule to try out first?