LSAT 19, Game 4 Setup, Student Panels, LSATHacks

Game Setup

This is a grouping game. We have nine people that to put on three tanels:  Oceans, Recycling and Wetlands. We can make a few deductions by combining the rules, but not many. Since we can’t do much up front, we’ll have to refer to our rules frequently on individual questions. On this sort of game you must internalize your rules.

Here is what the Main Diagram should look like:

We can draw the first two rules as two variables connected by arrows. Meaning: if you have F, then you need G and if you have G you need F. The arrows go both ways.

I’ve also drawn circles around N and L to show that they are the random variables. They have no rules.

Next we are told that F can’t be with P and G can’t be with H. Since F is always with G, this means that F also isn’t with P and H.

We can do the same thing with the rules about K, M and J. Since M is always with K, that means that J can’t be with M either. I’ve drawn a double sided arrow with a line in the middle to show that these things can never go together.

The last rule is a conditional. If H is in the oceans, then P has to be in the oceans. The contrapositive is: if P is not in the ocean then H is not in the ocean. Remember this rule well: it’s going to come up a lot.

That’s pretty much it. You could draw some scenarios, but they don’t tend to be useful in this game.

---