Diagram

[xiahong0]

This one blew my mind. It's not terribly hard but I can't categorize it. Is it just one of those pre-modern era rare games?

[ManhattanPrepLSAT1]

Yeah, this one's a bit weird. If you want to see another game exactly like it, check out out the third game from February 1997. They're identical.

I put together a setup and went through question 23 so you can get a sense for how to move through the questions. If you have questions about it, let me know.

[futurist26]

The LG questions from 18 to 24 are still breaking my brain. I am trying to understand the logic pattern behind question 18. Please help!!!

[ManhattanPrepLSAT1]

18. E

So we know that in year one N, O, and P participate. From the first constraint we know that in any two-year period all 5 clans must participate. If we look at years one and two, we know that there are two clans missing S and T. Thus, S and T must participate in year two along with another clan that cannot be determined.

Year 1: NOP
Year 2: ST?

So, we know that the correct answer choice must include S and T. Only one does - so answer choice (E) is correct.

[cyruswhittaker]

Also, due to the rules, each of the countries must conform to a placement pattern:

1-3-5
1-2-4
1-3-4
2-4-5
2-3-5

So for example if N is in 2, 4, we know that it MUST be in 5. This helps out a lot in the questions, such as with 22 and 24.

[seven7lx]

cyruswhittaker, may I know how you figured out the rules? They're very helpful!! Thanks.

[ManhattanPrepLSAT1]

This one has a very particular pattern. If you see the game as setting up

_ _ _ _ _
_ _ _ _ _
_ _ _ _ _
1 2 3 4 5

and you know that you have NOPST that must be assigned to three years each. Given that no clan can participate in three consecutive years and that each clan must participate in any two year period, then the pattern cyruswhittaker was talking about above is created.

Place N, O, P, S, and T in to the game board any way you'd like while satisfying the constraints. You'll find that no matter what happens your solution will conform to the pattern. Most people do not see this pattern until after they've worked through a few questions and see the same pattern emerge again and again.

If you cannot remember the numbered sets an easy way to find them is to place N, O, P, S, and T in that order again and again in the game board (following the same pattern: NOPST NOPST NOPST)

N S O T P
O T P N S
P N S O T
1 2 3 4 5

Moving down through one year and then moving to the next year, moving down, and then to the next year.

Then if you track NOPST, you get:

N = 1, 2, 4
O = 1, 3, 4
P = 1, 3, 5
S = 2, 3, 5
T = 2, 4, 5

Does that answer your question?

[apom22]

This game sucks!!

19 has me confused
20 I guessed A
21 A
22- B but I haven't completely ruled out D and E
23: I've narrowed it down to N and P as not being possible
24: E

[ManhattanPrepLSAT1]

Let me walk you through questions 19 and 22 and let's see if that clears up how to maneuver this game.

19.

(A) and (B) cannot be true as they violate the second constraint
(C) if you remember that the clans NOPST must each be assigned to one of the number sets

1-3-5
1-2-4
1-3-4
2-4-5
2-3-5

then you should be able to rule out answer choices (D) and (E). There are not two number sets with 1, 3, and 5 for N and S - eliminating answer choice (D). There are not two number sets with 2, 3, and 5 for S and T - eliminating answer choice (E). So while for answer choices (D) and (E) it is possible to assign one clan to those particular sets of years, it is not possible to assign 2 clans to the same three years. To see it visually answer choice (D) would look like...

_ S S _ S
_ T T _ T
_ _ _ _ _
1 2 3 4 5

This would force N, O, and P into years 1 and 4.

N S S N S
O T T O T
P _ _ P _
1 2 3 4 5

At this point, no matter what, it is not possible to have all 5 clans represented between years 2 and 3 - thus violating the first constraint.

The same issue would arise if we ran out answer choice (E).

22.

1-3-5
1-2-4
1-3-4
2-4-5
2-3-5

If N, O, and S were each assigned to the first year, then N, O, and S would be assigned to the first three number sets (although we would not be able to assign N, O, or S to any one particular number set. That means that P and T would need to be assigned to the last two number sets (although we would not know which number set specifically they would be assigned to). Regardless, it must be true that P and T are assigned to year 5.

(A) cannot be true. This would violate the second constraint.
(B) could be true if O was assigned to the third number set. But we cannot be sure which of the first three number sets O is assigned to.
(C) could be true if N and O were assigned to the first and third of the number sets, but again we do not know which of the first three number sets N and O are assigned.
(E) could be true. T is definitely assigned to year 5. But what about S? S could be assigned to year 5 if it is assigned to the first of the number sets, but it also could be assigned to the second or third number sets.


I hope this helps you see how this game is operated and helps you with the rest of the questions. If you still need help with it, let me know!

[apom22]

Thank you for taking the time to reply mshermn. I really appreciate the help. I think I understand this game a bit better now. I had no problems with the dance recital pattern game after seeing the setup but this game twisted my head.

Where can I find the Feb 97 version of this game? was it a repeated game or an identical setup with different variables?

[ManhattanPrepLSAT1]

You won't like the price...

http://www.amazon.com/Official-LSAT-Pre ... 804&sr=8-1

If anyone knows of a cheaper place to find this PT, please post it here for apom22, thanks!

[ManhattanPrepLSAT1]

If you'd like to get your hands on the February 1997 LSAT, it's in book called the Official LSAT PrepTest with Explanations and you can buy it here:

http://www.amazon.com/Official-LSAT-Pre ... 0942639685

It's just one LSAT and not worth the money for most people.

[syousif3]

I know each must participate 3 times in a cycle but with such limited time, how did you figure this out ?

1-3-5
1-2-4
1-3-4
2-4-5
2-3-5