Diagram

[ptroxler08]

Having trouble setting up the game. Can anyone recommend the proper way to set up this game in regards to making a template???

[ManhattanPrepLSAT1]

Here's a setup for the game.

Hint! Try setting up two frames, one with F and J in team 1 and another with F and J in team 2. Not everything fills in, but it does help as you answer the questions.

[kathleen.t.kao]

I combined rules 2 and 4 for this game and got something like this:

N2 --> G1 --> M2
Contra: M1 --> G2 --> N1

But as I moved forward with the game, I realized something is wrong with the setup. Can I not take the negation of, say, N1 to mean N2? There are only two places these consumers can go, after all.

[marokh9]

I set up the diagram for this game the same way as the PDF document that is posted and I got 5/6 questions right. However, I had trouble with question #6 and thats when I realized that I must be confusing myself with one of the rules.

The rule for H1 --> L1 suggests that when H is in group 1, L must be in group 1 as well, and if L is in group 1, then H does not have to be there. However, I don't particularly understand if H is in group 2, does that not imply that L does not have to be in group 2? or if L is in group 2, then H does not have to be in group 2.

As I am typing this, I think I know where I went wrong...that it does not matter if its group 1 or 2 since this is an in and out game... so when H1 --> L1, this is the same as H2 --> L2 ??

Help please!!

[ohthatpatrick]

H1 --> L1
does not mean the same thing as
H2 --> L2.

Let's say
Boat 1 contains L.
Boat 2 contains H.

That would contradict a rule that said
H2 --> L2

But that doesn't contradict the actual rule we were given
H1 --> L1.

Reading this rule, we would just think, "is H in boat 1? Nope." and thus the rule would disappear. A conditional rule only has any meaning if the left side idea is happening. If you know the left side idea is not happening, then the rule is just inapplicable and disappears.

You're correct that if we're given
H1 --> L1

that we do not know
L1 ---> H1

This is an illegal reversal of the original statement.

Conditional statements can't be just reversed or negated.

For instance, it's true to say:
IF I'm in Los Angeles, THEN I'm in California.

But reversing that statement isn't true:
IF I'm in California, THEN I'm in Los Angeles
(If I'm in Cali, I could be in hundreds of other Californian cities)

And negating the original statement isn't true:
IF I'm not in Los Angeles, THEN I'm not in California
(that's not valid ... if I'm in San Francisco, then I'm NOT in Los Angeles but still in California)

But we CAN reverse AND negate to get a true statement:
IF I'm not in California, THEN I'm not in Los Angeles.

That move, reversing AND negating, is called creating the contrapositive. You're going to see about 20 to 30 conditional statements on every LSAT. You want to get into the habit of always thinking through and/or writing down the contrapositive, especially because LSAT is specifically testing you on whether you understand that you CAN'T just negate, CAN'T just reverse, but CAN reverse-and-negate.

So what's the contrapositive of
H1 --> L1?
(reversed and negated)
~L1 --> ~H1
(those tildes mean NOT-L1, NOT-H1)

Well, when you're dealing with a binary option, like you MUST either be in boat 1 or boat 2, saying that "L is NOT in Boat 1" is identical to saying "L is in Boat 2".

So savvy test-takers write
L2 --> H2
instead of
~L1 --> ~H1

So when we write
H1 --> L1 in this game, we should also write its contrapositive
L2 --> H2

Hope this helps

[hzj184]

Based on the info, you can infer to have 4 scenarios:

1) FJG K/L & HNM L/K
2) FJN G/M & HKL M/G
3) LGKH & FJMN
4) LN G/M K/H & FJ M/G H/K