This is an explanation of the fourth logic game from Section IV of LSAT Preptest 36, the December 2001 LSAT.
Four pilots and four co-pilots are assigned to four flights (1, 2, 3, 4) that fly from New York to Saratoga. The four pilots are Fazio, Germond, Kyle, and Lopez (F, G, K, L). The co-pilots are Reich, Simon, Taylor, and Umlas (R, S, T, U). Exactly one pilot and one co-pilot are assigned to each flight.
This game isn’t so bad, compared to most games. It combines linear and grouping, but everything can be grouped into two simple scenarios. It’s good practice for the harder games that also require scenario creation.
The first task of any game (and often the hardest) is figuring out your layout. I prefer a vertical layout for this game. You can draw a column for pilots and copilots, and four rows.
I’ve drawn it below, and added in the rule that K goes second. It’s a good idea to read over all the rules first and draw the simple ones directly on the diagram.
Next, F takes off before G, and someone comes in between them.
F and G are both pilots. We can’t put F-G in 3-4 because no one would come between them. So F must go in 1, and G can go in either 3 or 4.
We also know that L (a pilot) has U as his copilot. We can combine all of these rules into two scenarios: one with G is in 3 and one with G is in 4.
Scenario with G in 3:
If G is in 3, then L must go in 4. It’s the only space left for a pilot.
If G is in 4 then L must be in 3:
- K is in 2 because a rule places him there.
- F is in 1, because F has to be kept separate from G.
- G can go in 3 or 4.
- L goes in the place G doesn’t go.
- U goes with L.
- There are no rules for R, S and T, the remaining copilots. They are random variables.
Need help with LG? → Try the LG Mastery Seminar
Solve hard games quickly